Base | Representation |
---|---|
bin | 10111001110000010110001… |
… | …000100101011001010011100 |
3 | 111101120120212021101021112202 |
4 | 113032002301010223022130 |
5 | 101341113442441103200 |
6 | 1001105155442551032 |
7 | 30336635414165015 |
oct | 2716026104531234 |
9 | 441516767337482 |
10 | 102120113222300 |
11 | 2a5a1995714728 |
12 | b55368b368478 |
13 | 44c9b68187604 |
14 | 1b308d5a7c00c |
15 | bc15a266a1d5 |
hex | 5ce0b112b29c |
102120113222300 has 72 divisors (see below), whose sum is σ = 227166956228016. Its totient is φ = 39831453941760.
The previous prime is 102120113222263. The next prime is 102120113222377. The reversal of 102120113222300 is 3222311021201.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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, 58240229 + ... + 59968028.
It is an arithmetic number, because the mean of its divisors is an integer number (3155096614278).
Almost surely, 2102120113222300 is an apocalyptic number.
102120113222300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102120113222300 is an abundant number, since it is smaller than the sum of its proper divisors (125046843005716).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102120113222300 is a wasteful number, since it uses less digits than its factorization.
102120113222300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118208487 (or 118208480 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 102120113222300 its reverse (3222311021201), we get a palindrome (105342424243501).
The spelling of 102120113222300 in words is "one hundred two trillion, one hundred twenty billion, one hundred thirteen million, two hundred twenty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •