Base | Representation |
---|---|
bin | 1001001100000010000010… |
… | …1010101001101101101100 |
3 | 1022202202211102200021012000 |
4 | 2103000200222221231230 |
5 | 2311004013122211022 |
6 | 33252534311412300 |
7 | 2061603454540101 |
oct | 223004052515554 |
9 | 38682742607160 |
10 | 10102311132012 |
11 | 32454032a3880 |
12 | 1171a8b684090 |
13 | 58384a709ca8 |
14 | 26cd510b8aa8 |
15 | 127bb6eec6ac |
hex | 93020aa9b6c |
10102311132012 has 96 divisors (see below), whose sum is σ = 28574139336960. Its totient is φ = 3061097879040.
The previous prime is 10102311131981. The next prime is 10102311132143. The reversal of 10102311132012 is 21023111320101.
10102311132012 is a `hidden beast` number, since 10 + 10 + 2 + 311 + 1 + 320 + 12 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17624643 + ... + 18188805.
It is an arithmetic number, because the mean of its divisors is an integer number (297647284760).
Almost surely, 210102311132012 is an apocalyptic number.
10102311132012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10102311132012 is an abundant number, since it is smaller than the sum of its proper divisors (18471828204948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10102311132012 is a wasteful number, since it uses less digits than its factorization.
10102311132012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 579260 (or 579252 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 10102311132012 its reverse (21023111320101), we get a palindrome (31125422452113).
The spelling of 10102311132012 in words is "ten trillion, one hundred two billion, three hundred eleven million, one hundred thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •