Base | Representation |
---|---|
bin | 1001010011000100000011… |
… | …0110111111101101001101 |
3 | 1100012022122010122222122110 |
4 | 2110301000312333231031 |
5 | 2314443412220314041 |
6 | 33424233153334233 |
7 | 2103411126656331 |
oct | 224610066775515 |
9 | 40168563588573 |
10 | 10223110323021 |
11 | 3291662296a32 |
12 | 1191382b67379 |
13 | 59205c352c3b |
14 | 274b306197c1 |
15 | 12add721a516 |
hex | 94c40dbfb4d |
10223110323021 has 8 divisors (see below), whose sum is σ = 13721084054464. Its totient is φ = 6770271736800.
The previous prime is 10223110323011. The next prime is 10223110323071. The reversal of 10223110323021 is 12032301132201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10223110323021 - 210 = 10223110321997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10223110323011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11283785776 + ... + 11283786681.
It is an arithmetic number, because the mean of its divisors is an integer number (1715135506808).
Almost surely, 210223110323021 is an apocalyptic number.
It is an amenable number.
10223110323021 is a deficient number, since it is larger than the sum of its proper divisors (3497973731443).
10223110323021 is a wasteful number, since it uses less digits than its factorization.
10223110323021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22567572611.
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 10223110323021 its reverse (12032301132201), we get a palindrome (22255411455222).
The spelling of 10223110323021 in words is "ten trillion, two hundred twenty-three billion, one hundred ten million, three hundred twenty-three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •