Base | Representation |
---|---|
bin | 10111010000111110111111… |
… | …101100100001011110001100 |
3 | 111102021220112120201121002111 |
4 | 113100332333230201132030 |
5 | 101402421402313343200 |
6 | 1001342102503433404 |
7 | 30360352022435563 |
oct | 2720767754413614 |
9 | 442256476647074 |
10 | 102322222012300 |
11 | 2a66a679877a84 |
12 | b586895155864 |
13 | 4512c37351504 |
14 | 1b3a5c9c56bda |
15 | bc6980ce10ba |
hex | 5d0fbfb2178c |
102322222012300 has 36 divisors (see below), whose sum is σ = 222043443841296. Its totient is φ = 40928110542400.
The previous prime is 102322222012277. The next prime is 102322222012343. The reversal of 102322222012300 is 3210222223201.
It is a super-2 number, since 2×1023222220123002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4428616 + ... + 14975215.
It is an arithmetic number, because the mean of its divisors is an integer number (6167873440036).
Almost surely, 2102322222012300 is an apocalyptic number.
102322222012300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102322222012300 is an abundant number, since it is smaller than the sum of its proper divisors (119721221828996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102322222012300 is a wasteful number, since it uses less digits than its factorization.
102322222012300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19456578 (or 19456571 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 22.
Adding to 102322222012300 its reverse (3210222223201), we get a palindrome (105532444235501).
The spelling of 102322222012300 in words is "one hundred two trillion, three hundred twenty-two billion, two hundred twenty-two million, twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •