Base | Representation |
---|---|
bin | 11011000100010110… |
… | …11011110111010010 |
3 | 1101111202122110222012 |
4 | 31202023123313102 |
5 | 214230202114040 |
6 | 10402000342522 |
7 | 1023055346414 |
oct | 154213336722 |
9 | 41452573865 |
10 | 14532066770 |
11 | 6187a77941 |
12 | 2996914a42 |
13 | 14a79108a0 |
14 | 9bc0189b4 |
15 | 5a0bd2865 |
hex | 3622dbdd2 |
14532066770 has 64 divisors (see below), whose sum is σ = 30020336640. Its totient is φ = 5023147008.
The previous prime is 14532066743. The next prime is 14532066797. The reversal of 14532066770 is 7766023541.
It is an interprime number because it is at equal distance from previous prime (14532066743) and next prime (14532066797).
It is a super-2 number, since 2×145320667702 (a number of 21 digits) contains 22 as substring.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 88826 + ... + 192234.
It is an arithmetic number, because the mean of its divisors is an integer number (469067760).
Almost surely, 214532066770 is an apocalyptic number.
14532066770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14532066770 is an abundant number, since it is smaller than the sum of its proper divisors (15488269870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14532066770 is a wasteful number, since it uses less digits than its factorization.
14532066770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103499.
The product of its (nonzero) digits is 211680, while the sum is 41.
The spelling of 14532066770 in words is "fourteen billion, five hundred thirty-two million, sixty-six thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •