Base | Representation |
---|---|
bin | 11010010011010000… |
… | …10101110000101111 |
3 | 1100110001200011120021 |
4 | 31021220111300233 |
5 | 212404233313201 |
6 | 10253045103011 |
7 | 1006624556233 |
oct | 151150256057 |
9 | 40401604507 |
10 | 14120213551 |
11 | 5a96546484 |
12 | 28a09b7a67 |
13 | 14404ac062 |
14 | 97d44a5c3 |
15 | 57997bea1 |
hex | 349a15c2f |
14120213551 has 8 divisors (see below), whose sum is σ = 14223444480. Its totient is φ = 14017185432.
The previous prime is 14120213543. The next prime is 14120213561. The reversal of 14120213551 is 15531202141.
14120213551 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 14120213551 - 23 = 14120213543 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14120213501) 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, 90480 + ... + 190858.
It is an arithmetic number, because the mean of its divisors is an integer number (1777930560).
Almost surely, 214120213551 is an apocalyptic number.
14120213551 is a deficient number, since it is larger than the sum of its proper divisors (103230929).
14120213551 is a wasteful number, since it uses less digits than its factorization.
14120213551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101405.
The product of its (nonzero) digits is 1200, while the sum is 25.
Adding to 14120213551 its reverse (15531202141), we get a palindrome (29651415692).
The spelling of 14120213551 in words is "fourteen billion, one hundred twenty million, two hundred thirteen thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •