Base | Representation |
---|---|
bin | 10111001110001110000010… |
… | …000110101001011100101100 |
3 | 111101121202002022210221222201 |
4 | 113032032002012221130230 |
5 | 101341313231242043200 |
6 | 1001114520053151244 |
7 | 30340544243101624 |
oct | 2716160206513454 |
9 | 441552068727881 |
10 | 102132210112300 |
11 | 2a5a7033033185 |
12 | b555aa662b524 |
13 | 44cb0454141a4 |
14 | 1b313224bb884 |
15 | bc1a5e678c6a |
hex | 5ce3821a972c |
102132210112300 has 36 divisors (see below), whose sum is σ = 229269202706880. Its totient is φ = 39444163904320.
The previous prime is 102132210112279. The next prime is 102132210112319. The reversal of 102132210112300 is 3211012231201.
It is a super-2 number, since 2×1021322101123002 (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, 17608998844 + ... + 17609004643.
It is an arithmetic number, because the mean of its divisors is an integer number (6368588964080).
Almost surely, 2102132210112300 is an apocalyptic number.
102132210112300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102132210112300 is an abundant number, since it is smaller than the sum of its proper divisors (127136992594580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102132210112300 is a wasteful number, since it uses less digits than its factorization.
102132210112300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35218003530 (or 35218003523 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 102132210112300 its reverse (3211012231201), we get a palindrome (105343222343501).
The spelling of 102132210112300 in words is "one hundred two trillion, one hundred thirty-two billion, two hundred ten million, one hundred twelve thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •