Base | Representation |
---|---|
bin | 10111001100010100000010… |
… | …101011100111011110010010 |
3 | 111101011012222122000111202121 |
4 | 113030110002223213132102 |
5 | 101332142001131113020 |
6 | 1000534414243204454 |
7 | 30325226254423465 |
oct | 2714240253473622 |
9 | 441135878014677 |
10 | 102001223301010 |
11 | 2a556526429130 |
12 | b53462b37672a |
13 | 44bb89bc6c567 |
14 | 1b28c57d392dc |
15 | bbd444d8bbaa |
hex | 5cc502ae7792 |
102001223301010 has 32 divisors (see below), whose sum is σ = 201242568654144. Its totient is φ = 36915565512000.
The previous prime is 102001223301001. The next prime is 102001223301017. The reversal of 102001223301010 is 10103322100201.
It is a super-2 number, since 2×1020012233010102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102001223301017) 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 15 ways as a sum of consecutive naturals, for example, 2197331881 + ... + 2197378300.
It is an arithmetic number, because the mean of its divisors is an integer number (6288830270442).
Almost surely, 2102001223301010 is an apocalyptic number.
102001223301010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102001223301010 is a deficient number, since it is larger than the sum of its proper divisors (99241345353134).
102001223301010 is a wasteful number, since it uses less digits than its factorization.
102001223301010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4394710410.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102001223301010 its reverse (10103322100201), we get a palindrome (112104545401211).
The spelling of 102001223301010 in words is "one hundred two trillion, one billion, two hundred twenty-three million, three hundred one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •