Base | Representation |
---|---|
bin | 11011000110111011… |
… | …01100100101001011 |
3 | 1101120021020001121021 |
4 | 31203131230211023 |
5 | 214301212143201 |
6 | 10404050453311 |
7 | 1023436552141 |
oct | 154335544513 |
9 | 41507201537 |
10 | 14553631051 |
11 | 6199166463 |
12 | 29a1b94237 |
13 | 14ac22100b |
14 | 9c0c2d591 |
15 | 5a2a41ea1 |
hex | 36376c94b |
14553631051 has 8 divisors (see below), whose sum is σ = 14912781408. Its totient is φ = 14194680000.
The previous prime is 14553631013. The next prime is 14553631159. The reversal of 14553631051 is 15013635541.
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 14553631051 - 213 = 14553622859 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14553630998 and 14553631016.
It is not an unprimeable number, because it can be changed into a prime (14553635051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 103786 + ... + 199696.
It is an arithmetic number, because the mean of its divisors is an integer number (1864097676).
Almost surely, 214553631051 is an apocalyptic number.
14553631051 is a deficient number, since it is larger than the sum of its proper divisors (359150357).
14553631051 is an equidigital number, since it uses as much as digits as its factorization.
14553631051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99653.
The product of its (nonzero) digits is 27000, while the sum is 34.
The spelling of 14553631051 in words is "fourteen billion, five hundred fifty-three million, six hundred thirty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •