Base | Representation |
---|---|
bin | 10111001100100101101001… |
… | …101111011011100011100000 |
3 | 111101020000210102111021122002 |
4 | 113030211221233123203200 |
5 | 101332444212322120300 |
6 | 1000551222435103132 |
7 | 30326465660544512 |
oct | 2714455157334340 |
9 | 441200712437562 |
10 | 102020132223200 |
11 | 2a563549a87254 |
12 | b538227a41aa8 |
13 | 44c05c359b609 |
14 | 1b29b2d365bb2 |
15 | bbdb9ee355d5 |
hex | 5cc969bdb8e0 |
102020132223200 has 144 divisors (see below), whose sum is σ = 258213414533760. Its totient is φ = 39319209216000.
The previous prime is 102020132223197. The next prime is 102020132223223. The reversal of 102020132223200 is 2322231020201.
It is a happy number.
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, 3302711 + ... + 14661110.
It is an arithmetic number, because the mean of its divisors is an integer number (1793148712040).
Almost surely, 2102020132223200 is an apocalyptic number.
102020132223200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102020132223200 is an abundant number, since it is smaller than the sum of its proper divisors (156193282310560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102020132223200 is a wasteful number, since it uses less digits than its factorization.
102020132223200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17964101 (or 17964088 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 102020132223200 its reverse (2322231020201), we get a palindrome (104342363243401).
The spelling of 102020132223200 in words is "one hundred two trillion, twenty billion, one hundred thirty-two million, two hundred twenty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •