Base | Representation |
---|---|
bin | 10110100010101010… |
… | …11010001111100100 |
3 | 1011020102000112211000 |
4 | 23101111122033210 |
5 | 144241102012002 |
6 | 5320511313300 |
7 | 605620114560 |
oct | 132125321744 |
9 | 34212015730 |
10 | 12101985252 |
11 | 5150289705 |
12 | 2418b1b830 |
13 | 11ab321b26 |
14 | 82b3a86a0 |
15 | 4ac6b861c |
hex | 2d155a3e4 |
12101985252 has 96 divisors (see below), whose sum is σ = 36732407040. Its totient is φ = 3373367040.
The previous prime is 12101985199. The next prime is 12101985289. The reversal of 12101985252 is 25258910121.
12101985252 is a `hidden beast` number, since 1 + 210 + 198 + 5 + 252 = 666.
12101985252 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 164223 + ... + 226214.
It is an arithmetic number, because the mean of its divisors is an integer number (382629240).
Almost surely, 212101985252 is an apocalyptic number.
12101985252 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
12101985252 is an abundant number, since it is smaller than the sum of its proper divisors (24630421788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12101985252 is a wasteful number, since it uses less digits than its factorization.
12101985252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 390498 (or 390490 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 36.
The spelling of 12101985252 in words is "twelve billion, one hundred one million, nine hundred eighty-five thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •