Base | Representation |
---|---|
bin | 11011001000001010… |
… | …10111011101011011 |
3 | 1101120222210101200121 |
4 | 31210011113131123 |
5 | 214311342432144 |
6 | 10405101414111 |
7 | 1023624133510 |
oct | 154405273533 |
9 | 41528711617 |
10 | 14564030299 |
11 | 61a4019585 |
12 | 29a556a337 |
13 | 14b1422510 |
14 | 9c2379307 |
15 | 5a38e8384 |
hex | 36415775b |
14564030299 has 16 divisors (see below), whose sum is σ = 18503188480. Its totient is φ = 11151470880.
The previous prime is 14564030281. The next prime is 14564030323. The reversal of 14564030299 is 99203046541.
It is a cyclic number.
It is not a de Polignac number, because 14564030299 - 25 = 14564030267 is a prime.
It is a super-2 number, since 2×145640302992 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (14564030269) 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 15 ways as a sum of consecutive naturals, for example, 2578539 + ... + 2584180.
It is an arithmetic number, because the mean of its divisors is an integer number (1156449280).
Almost surely, 214564030299 is an apocalyptic number.
14564030299 is a deficient number, since it is larger than the sum of its proper divisors (3939158181).
14564030299 is a wasteful number, since it uses less digits than its factorization.
14564030299 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5162770.
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 14564030299 in words is "fourteen billion, five hundred sixty-four million, thirty thousand, two hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •