Base | Representation |
---|---|
bin | 10110100100001011… |
… | …01110100110110010 |
3 | 1011021021212001201220 |
4 | 23102011232212302 |
5 | 144302322322240 |
6 | 5322043005510 |
7 | 606132560610 |
oct | 132205564662 |
9 | 34237761656 |
10 | 12114651570 |
11 | 515745003a |
12 | 2421209896 |
13 | 11b0b381a8 |
14 | 82cd446b0 |
15 | 4ad86b5d0 |
hex | 2d216e9b2 |
12114651570 has 64 divisors (see below), whose sum is σ = 33283319040. Its totient is φ = 2764516608.
The previous prime is 12114651557. The next prime is 12114651611. The reversal of 12114651570 is 7515641121.
12114651570 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
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, 81676 + ... + 175784.
It is an arithmetic number, because the mean of its divisors is an integer number (520051860).
Almost surely, 212114651570 is an apocalyptic number.
12114651570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
12114651570 is an abundant number, since it is smaller than the sum of its proper divisors (21168667470).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12114651570 is a wasteful number, since it uses less digits than its factorization.
12114651570 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94739.
The product of its (nonzero) digits is 8400, while the sum is 33.
The spelling of 12114651570 in words is "twelve billion, one hundred fourteen million, six hundred fifty-one thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.167 sec. • engine limits •