Base | Representation |
---|---|
bin | 11011011110101100… |
… | …10011000011000100 |
3 | 1102002011101222011000 |
4 | 31233112103003010 |
5 | 220203233034202 |
6 | 10435532213300 |
7 | 1031410404303 |
oct | 155726230304 |
9 | 42064358130 |
10 | 14753018052 |
11 | 629076a903 |
12 | 2a3890a230 |
13 | 15116222a6 |
14 | 9dd4d243a |
15 | 5b52c991c |
hex | 36f5930c4 |
14753018052 has 24 divisors (see below), whose sum is σ = 38248565600. Its totient is φ = 4917672648.
The previous prime is 14753018039. The next prime is 14753018089. The reversal of 14753018052 is 25081035741.
14753018052 is a `hidden beast` number, since 1 + 47 + 530 + 1 + 80 + 5 + 2 = 666.
14753018052 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 14753017998 and 14753018016.
It is an unprimeable number.
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, 68300902 + ... + 68301117.
Almost surely, 214753018052 is an apocalyptic number.
14753018052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
14753018052 is an abundant number, since it is smaller than the sum of its proper divisors (23495547548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14753018052 is a wasteful number, since it uses less digits than its factorization.
14753018052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136602032 (or 136602024 counting only the distinct ones).
The product of its (nonzero) digits is 33600, while the sum is 36.
The spelling of 14753018052 in words is "fourteen billion, seven hundred fifty-three million, eighteen thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •