Base | Representation |
---|---|
bin | 11011000010000101… |
… | …10100111110101010 |
3 | 1101110102211110201120 |
4 | 31201002310332222 |
5 | 214210314030010 |
6 | 10400040400110 |
7 | 1022434513641 |
oct | 154102647652 |
9 | 41412743646 |
10 | 14513033130 |
11 | 6178257662 |
12 | 2990476036 |
13 | 14a39a828b |
14 | 9b96a2358 |
15 | 59e1c2e70 |
hex | 3610b4faa |
14513033130 has 32 divisors (see below), whose sum is σ = 35039862144. Its totient is φ = 3846966336.
The previous prime is 14513033083. The next prime is 14513033149. The reversal of 14513033130 is 3133031541.
14513033130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 14513033130.
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 15 ways as a sum of consecutive naturals, for example, 1443397 + ... + 1453416.
It is an arithmetic number, because the mean of its divisors is an integer number (1094995692).
Almost surely, 214513033130 is an apocalyptic number.
14513033130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14513033130 is an abundant number, since it is smaller than the sum of its proper divisors (20526829014).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14513033130 is a wasteful number, since it uses less digits than its factorization.
14513033130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2896990.
The product of its (nonzero) digits is 1620, while the sum is 24.
Adding to 14513033130 its reverse (3133031541), we get a palindrome (17646064671).
The spelling of 14513033130 in words is "fourteen billion, five hundred thirteen million, thirty-three thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •