Base | Representation |
---|---|
bin | 10100110011111011101… |
… | …111000001111010101110 |
3 | 12001201110210100011000010 |
4 | 110303323233001322232 |
5 | 141412423023131420 |
6 | 3013000352314050 |
7 | 205216341055152 |
oct | 24637357017256 |
9 | 5051423304003 |
10 | 1430152552110 |
11 | 501584916a47 |
12 | 1b120b242926 |
13 | a4b2a782699 |
14 | 4d311005062 |
15 | 2730536e4e0 |
hex | 14cfbbc1eae |
1430152552110 has 16 divisors (see below), whose sum is σ = 3432366125136. Its totient is φ = 381374013888.
The previous prime is 1430152552099. The next prime is 1430152552117. The reversal of 1430152552110 is 112552510341.
It is a Harshad number since it is a multiple of its sum of digits (30), and also a Moran number because the ratio is a prime number: 47671751737 = 1430152552110 / (1 + 4 + 3 + 0 + 1 + 5 + 2 + 5 + 5 + 2 + 1 + 1 + 0).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430152552117) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 23835875839 + ... + 23835875898.
It is an arithmetic number, because the mean of its divisors is an integer number (214522882821).
Almost surely, 21430152552110 is an apocalyptic number.
1430152552110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1430152552110 is an abundant number, since it is smaller than the sum of its proper divisors (2002213573026).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1430152552110 is a wasteful number, since it uses less digits than its factorization.
1430152552110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47671751747.
The product of its (nonzero) digits is 6000, while the sum is 30.
The spelling of 1430152552110 in words is "one trillion, four hundred thirty billion, one hundred fifty-two million, five hundred fifty-two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.391 sec. • engine limits •