Base | Representation |
---|---|
bin | 11101011101011001000… |
… | …10011000110001101100 |
3 | 10120202200210110211000010 |
4 | 32232230202120301230 |
5 | 113041002233310332 |
6 | 2053000452133220 |
7 | 133062362061003 |
oct | 16565442306154 |
9 | 3522623424003 |
10 | 1012212010092 |
11 | 360305322918 |
12 | 14420b907210 |
13 | 745b333110a |
14 | 36dc4291c3a |
15 | 1b4e39149cc |
hex | ebac898c6c |
1012212010092 has 24 divisors (see below), whose sum is σ = 2361854905200. Its totient is φ = 337400163136.
The previous prime is 1012212010091. The next prime is 1012212010163. The reversal of 1012212010092 is 2900102122101.
1012212010092 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (1012212010091) 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, 742834 + ... + 1605062.
It is an arithmetic number, because the mean of its divisors is an integer number (98410621050).
Almost surely, 21012212010092 is an apocalyptic number.
1012212010092 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1012212010092 is an abundant number, since it is smaller than the sum of its proper divisors (1349642895108).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1012212010092 is a wasteful number, since it uses less digits than its factorization.
1012212010092 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 960065 (or 960063 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 1012212010092 its reverse (2900102122101), we get a palindrome (3912314132193).
The spelling of 1012212010092 in words is "one trillion, twelve billion, two hundred twelve million, ten thousand, ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •