Base | Representation |
---|---|
bin | 10111010000111101111101… |
… | …100110110010100010101100 |
3 | 111102021210200022022202112110 |
4 | 113100331331212302202230 |
5 | 101402412114440304400 |
6 | 1001341400454204020 |
7 | 30360312400004055 |
oct | 2720757546624254 |
9 | 442253608282473 |
10 | 102321113213100 |
11 | 2a66a15a9a2801 |
12 | b586625953610 |
13 | 4512abb70c702 |
14 | 1b3a5228a772c |
15 | bc69187bce50 |
hex | 5d0f7d9b28ac |
102321113213100 has 72 divisors (see below), whose sum is σ = 298309004376768. Its totient is φ = 27077342926400.
The previous prime is 102321113213087. The next prime is 102321113213149. The reversal of 102321113213100 is 1312311123201.
It is a super-2 number, since 2×1023211132131002 (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 23 ways as a sum of consecutive naturals, for example, 1301756034 + ... + 1301834633.
It is an arithmetic number, because the mean of its divisors is an integer number (4143180616344).
Almost surely, 2102321113213100 is an apocalyptic number.
102321113213100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102321113213100 is an abundant number, since it is smaller than the sum of its proper divisors (195987891163668).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102321113213100 is a wasteful number, since it uses less digits than its factorization.
102321113213100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2603590815 (or 2603590808 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 102321113213100 its reverse (1312311123201), we get a palindrome (103633424336301).
The spelling of 102321113213100 in words is "one hundred two trillion, three hundred twenty-one billion, one hundred thirteen million, two hundred thirteen thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •