Base | Representation |
---|---|
bin | 10111001100011100011111… |
… | …110000101011000100100010 |
3 | 111101012002102021111111100221 |
4 | 113030130133300223010202 |
5 | 101332314044040202242 |
6 | 1000542515124033254 |
7 | 30326000233433626 |
oct | 2714343760530442 |
9 | 441162367444327 |
10 | 102010301100322 |
11 | 2a55a36462810a |
12 | b53634353282a |
13 | 44bc6b788c344 |
14 | 1b29479803186 |
15 | bbd7c6cd5167 |
hex | 5cc71fc2b122 |
102010301100322 has 16 divisors (see below), whose sum is σ = 153705041747712. Its totient is φ = 50775297369840.
The previous prime is 102010301100307. The next prime is 102010301100341. The reversal of 102010301100322 is 223001103010201.
It is a super-2 number, since 2×1020103011003222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102010301100296 and 102010301100305.
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, 17687797 + ... + 22734967.
It is an arithmetic number, because the mean of its divisors is an integer number (9606565109232).
Almost surely, 2102010301100322 is an apocalyptic number.
102010301100322 is a deficient number, since it is larger than the sum of its proper divisors (51694740647390).
102010301100322 is a wasteful number, since it uses less digits than its factorization.
102010301100322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5092713.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102010301100322 its reverse (223001103010201), we get a palindrome (325011404110523).
The spelling of 102010301100322 in words is "one hundred two trillion, ten billion, three hundred one million, one hundred thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •