Base | Representation |
---|---|
bin | 1001001011111010101000… |
… | …0011101111011010000110 |
3 | 1022202120200202022021101122 |
4 | 2102332222003233122012 |
5 | 2310440424213021410 |
6 | 33252005024553542 |
7 | 2061503242553033 |
oct | 222765203573206 |
9 | 38676622267348 |
10 | 10100321220230 |
11 | 324458201768a |
12 | 11716151828b2 |
13 | 5835c13856b7 |
14 | 26cc02ac838a |
15 | 127aec47de55 |
hex | 92faa0ef686 |
10100321220230 has 16 divisors (see below), whose sum is σ = 18180621187344. Its totient is φ = 4040118934560.
The previous prime is 10100321220229. The next prime is 10100321220271. The reversal of 10100321220230 is 3202212300101.
It is a super-2 number, since 2×101003212202302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10100321220199 and 10100321220208.
It is a congruent number.
It is an unprimeable number.
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, 4572020 + ... + 6411240.
It is an arithmetic number, because the mean of its divisors is an integer number (1136288824209).
Almost surely, 210100321220230 is an apocalyptic number.
10100321220230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10100321220230 is a deficient number, since it is larger than the sum of its proper divisors (8080299967114).
10100321220230 is a wasteful number, since it uses less digits than its factorization.
10100321220230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2388391.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 10100321220230 its reverse (3202212300101), we get a palindrome (13302533520331).
The spelling of 10100321220230 in words is "ten trillion, one hundred billion, three hundred twenty-one million, two hundred twenty thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •