Base | Representation |
---|---|
bin | 1001010011000100000011… |
… | …0110001010000010100010 |
3 | 1100012022122010020211010000 |
4 | 2110301000312022002202 |
5 | 2314443412141300302 |
6 | 33424233144520430 |
7 | 2103411125052423 |
oct | 224610066120242 |
9 | 40168563224100 |
10 | 10223110103202 |
11 | 3291662156867 |
12 | 1191382a80116 |
13 | 59205c2a6b79 |
14 | 274b3059d64a |
15 | 12add71c531c |
hex | 94c40d8a0a2 |
10223110103202 has 40 divisors (see below), whose sum is σ = 22911113507436. Its totient is φ = 3407141916288.
The previous prime is 10223110103201. The next prime is 10223110103231. The reversal of 10223110103202 is 20230101132201.
10223110103202 is a `hidden beast` number, since 1 + 0 + 22 + 311 + 0 + 10 + 320 + 2 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 7497470898801 + 2725639204401 = 2738151^2 + 1650951^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (10223110103201) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4211763 + ... + 6179414.
Almost surely, 210223110103202 is an apocalyptic number.
10223110103202 is an abundant number, since it is smaller than the sum of its proper divisors (12688003404234).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10223110103202 is a wasteful number, since it uses less digits than its factorization.
10223110103202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10397264 (or 10397255 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 10223110103202 its reverse (20230101132201), we get a palindrome (30453211235403).
The spelling of 10223110103202 in words is "ten trillion, two hundred twenty-three billion, one hundred ten million, one hundred three thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.042 sec. • engine limits •