Base | Representation |
---|---|
bin | 11011010011101000… |
… | …10001010110011001 |
3 | 1101211200202221100022 |
4 | 31221310101112121 |
5 | 220011003241441 |
6 | 10422415120225 |
7 | 1026202514132 |
oct | 155164212631 |
9 | 41750687308 |
10 | 14660212121 |
11 | 6243342395 |
12 | 2a11813075 |
13 | 14c832a139 |
14 | 9d1054c89 |
15 | 5ac09684b |
hex | 369d11599 |
14660212121 has 8 divisors (see below), whose sum is σ = 15305267904. Its totient is φ = 14015794320.
The previous prime is 14660212111. The next prime is 14660212169. The reversal of 14660212121 is 12121206641.
14660212121 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 14660212121 - 26 = 14660212057 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14660212111) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 112226 + ... + 204731.
It is an arithmetic number, because the mean of its divisors is an integer number (1913158488).
Almost surely, 214660212121 is an apocalyptic number.
It is an amenable number.
14660212121 is a deficient number, since it is larger than the sum of its proper divisors (645055783).
14660212121 is a wasteful number, since it uses less digits than its factorization.
14660212121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 318991.
The product of its (nonzero) digits is 1152, while the sum is 26.
Adding to 14660212121 its reverse (12121206641), we get a palindrome (26781418762).
The spelling of 14660212121 in words is "fourteen billion, six hundred sixty million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •