Base | Representation |
---|---|
bin | 11011000001010111… |
… | …00111011111111111 |
3 | 1101110000101100022212 |
4 | 31200223213133333 |
5 | 214202234323412 |
6 | 10355302131035 |
7 | 1022332012544 |
oct | 154053473777 |
9 | 41400340285 |
10 | 14506948607 |
11 | 6174881228 |
12 | 298a420a7b |
13 | 14a2657978 |
14 | 9b895abcb |
15 | 59d8c0222 |
hex | 360ae77ff |
14506948607 has 16 divisors (see below), whose sum is σ = 15086103552. Its totient is φ = 13940461920.
The previous prime is 14506948597. The next prime is 14506948627. The reversal of 14506948607 is 70684960541.
It is a cyclic number.
It is not a de Polignac number, because 14506948607 - 26 = 14506948543 is a prime.
It is a super-2 number, since 2×145069486072 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14506948627) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 971933 + ... + 986745.
It is an arithmetic number, because the mean of its divisors is an integer number (942881472).
Almost surely, 214506948607 is an apocalyptic number.
14506948607 is a deficient number, since it is larger than the sum of its proper divisors (579154945).
14506948607 is a wasteful number, since it uses less digits than its factorization.
14506948607 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15238.
The product of its (nonzero) digits is 1451520, while the sum is 50.
The spelling of 14506948607 in words is "fourteen billion, five hundred six million, nine hundred forty-eight thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •