Base | Representation |
---|---|
bin | 1001000110101010111001… |
… | …1110110011110111001100 |
3 | 1022102222002010102102202210 |
4 | 2101222232132303313030 |
5 | 2303001342441041022 |
6 | 33142342314150420 |
7 | 2052133054354533 |
oct | 221525636636714 |
9 | 38388063372683 |
10 | 10010201112012 |
11 | 320a336620502 |
12 | 1158064122410 |
13 | 577c5b6cc18a |
14 | 2686d3c8331a |
15 | 1255c57c9a0c |
hex | 91aae7b3dcc |
10010201112012 has 24 divisors (see below), whose sum is σ = 23360133340656. Its totient is φ = 3336305502208.
The previous prime is 10010201111983. The next prime is 10010201112017. The reversal of 10010201112012 is 21021110201001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (10010201112017) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 53427813 + ... + 53614844.
It is an arithmetic number, because the mean of its divisors is an integer number (973338889194).
Almost surely, 210010201112012 is an apocalyptic number.
10010201112012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10010201112012 is an abundant number, since it is smaller than the sum of its proper divisors (13349932228644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010201112012 is a wasteful number, since it uses less digits than its factorization.
10010201112012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107050457 (or 107050455 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 10010201112012 its reverse (21021110201001), we get a palindrome (31031311313013).
The spelling of 10010201112012 in words is "ten trillion, ten billion, two hundred one million, one hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •