Base | Representation |
---|---|
bin | 11010101001100111… |
… | …10000010001111010 |
3 | 1100221010120021020200 |
4 | 31110303300101322 |
5 | 213300241131010 |
6 | 10323424503030 |
7 | 1014362624544 |
oct | 152463602172 |
9 | 40833507220 |
10 | 14307755130 |
11 | 608239a219 |
12 | 293377aa76 |
13 | 14702c37c6 |
14 | 99a308694 |
15 | 58b174cc0 |
hex | 354cf047a |
14307755130 has 48 divisors (see below), whose sum is σ = 38817567360. Its totient is φ = 3649513824.
The previous prime is 14307755123. The next prime is 14307755131. The reversal of 14307755130 is 3155770341.
14307755130 is a `hidden beast` number, since 1 + 4 + 3 + 0 + 77 + 551 + 30 = 666.
14307755130 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (14307755131) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 3453910 + ... + 3458049.
It is an arithmetic number, because the mean of its divisors is an integer number (808699320).
Almost surely, 214307755130 is an apocalyptic number.
14307755130 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
14307755130 is an abundant number, since it is smaller than the sum of its proper divisors (24509812230).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14307755130 is a wasteful number, since it uses less digits than its factorization.
14307755130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6911995 (or 6911992 counting only the distinct ones).
The product of its (nonzero) digits is 44100, while the sum is 36.
The spelling of 14307755130 in words is "fourteen billion, three hundred seven million, seven hundred fifty-five thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •