Base | Representation |
---|---|
bin | 10111001100011101001111… |
… | …011000010110010101110010 |
3 | 111101012011110221211100021221 |
4 | 113030131033120112111302 |
5 | 101332322213101432242 |
6 | 1000543130303535254 |
7 | 30326026104302620 |
oct | 2714351730262562 |
9 | 441164427740257 |
10 | 102011100030322 |
11 | 2a55a7345a803a |
12 | b536526bba52a |
13 | 44bc7b42591a2 |
14 | 1b29513970510 |
15 | bbd821eea167 |
hex | 5cc74f616572 |
102011100030322 has 16 divisors (see below), whose sum is σ = 174884869241280. Its totient is φ = 43716868429968.
The previous prime is 102011100030299. The next prime is 102011100030347. The reversal of 102011100030322 is 223030001110201.
It is a super-2 number, since 2×1020111000303222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102011100030296 and 102011100030305.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 180911797 + ... + 181474792.
It is an arithmetic number, because the mean of its divisors is an integer number (10930304327580).
Almost surely, 2102011100030322 is an apocalyptic number.
102011100030322 is a deficient number, since it is larger than the sum of its proper divisors (72873769210958).
102011100030322 is a wasteful number, since it uses less digits than its factorization.
102011100030322 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 362406705.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 102011100030322 its reverse (223030001110201), we get a palindrome (325041101140523).
The spelling of 102011100030322 in words is "one hundred two trillion, eleven billion, one hundred million, thirty thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •