Base | Representation |
---|---|
bin | 101011101100000001110… |
… | …011001010111000001111 |
3 | 101122000020100011100002011 |
4 | 223230001303022320033 |
5 | 343142012324043043 |
6 | 10215110341242051 |
7 | 426621422521543 |
oct | 53540163127017 |
9 | 11560210140064 |
10 | 3002212331023 |
11 | a5825a658824 |
12 | 405a22a03327 |
13 | 18a151c8b109 |
14 | a5444a63a23 |
15 | 53163a9959d |
hex | 2bb01ccae0f |
3002212331023 has 16 divisors (see below), whose sum is σ = 3212474909440. Its totient is φ = 2797309468800.
The previous prime is 3002212331011. The next prime is 3002212331033. The reversal of 3002212331023 is 3201332122003.
3002212331023 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 3002212331023 - 25 = 3002212330991 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3002212330985 and 3002212331003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3002212331033) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1065498 + ... + 2672023.
It is an arithmetic number, because the mean of its divisors is an integer number (200779681840).
Almost surely, 23002212331023 is an apocalyptic number.
3002212331023 is a deficient number, since it is larger than the sum of its proper divisors (210262578417).
3002212331023 is a wasteful number, since it uses less digits than its factorization.
3002212331023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3738238.
The product of its (nonzero) digits is 1296, while the sum is 22.
Adding to 3002212331023 its reverse (3201332122003), we get a palindrome (6203544453026).
The spelling of 3002212331023 in words is "three trillion, two billion, two hundred twelve million, three hundred thirty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •