Base | Representation |
---|---|
bin | 1001000111101011101… |
… | …01001111101111110001 |
3 | 1002221211201221001011011 |
4 | 10203311311033233301 |
5 | 20113231134140421 |
6 | 355542335350521 |
7 | 31432255143004 |
oct | 4436565175761 |
9 | 1087751831134 |
10 | 313362021361 |
11 | 110994767764 |
12 | 50894382441 |
13 | 2371c20541c |
14 | 112499c753b |
15 | 82407c14e1 |
hex | 48f5d4fbf1 |
313362021361 has 4 divisors (see below), whose sum is σ = 313363228132. Its totient is φ = 313360814592.
The previous prime is 313362021311. The next prime is 313362021383. The reversal of 313362021361 is 163120263313.
It is a semiprime because it is the product of two primes, and also a brilliant number, because the two primes have the same length.
It can be written as a sum of positive squares in 2 ways, for example, as 3129731136 + 310232290225 = 55944^2 + 556985^2 .
It is a cyclic number.
It is not a de Polignac number, because 313362021361 - 27 = 313362021233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (313362021311) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 36096 + ... + 792481.
It is an arithmetic number, because the mean of its divisors is an integer number (78340807033).
Almost surely, 2313362021361 is an apocalyptic number.
It is an amenable number.
313362021361 is a deficient number, since it is larger than the sum of its proper divisors (1206771).
313362021361 is an equidigital number, since it uses as much as digits as its factorization.
313362021361 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1206770.
The product of its (nonzero) digits is 11664, while the sum is 31.
Adding to 313362021361 its reverse (163120263313), we get a palindrome (476482284674).
The spelling of 313362021361 in words is "three hundred thirteen billion, three hundred sixty-two million, twenty-one thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •