Base | Representation |
---|---|
bin | 10100110011111000111… |
… | …010011101000011111001 |
3 | 12001201100111021012000011 |
4 | 110303320322131003321 |
5 | 141412323413341400 |
6 | 3012551541541521 |
7 | 205215224521561 |
oct | 24637072350371 |
9 | 5051314235004 |
10 | 1430105215225 |
11 | 501560125055 |
12 | 1b11b74148a1 |
13 | a4b20a1a4ab |
14 | 4d308a01da1 |
15 | 2730111d8ba |
hex | 14cf8e9d0f9 |
1430105215225 has 12 divisors (see below), whose sum is σ = 1798306954560. Its totient is φ = 1127970309200.
The previous prime is 1430105215223. The next prime is 1430105215249. The reversal of 1430105215225 is 5225125010341.
It is not a de Polignac number, because 1430105215225 - 21 = 1430105215223 is a prime.
It is a super-2 number, since 2×14301052152252 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1430105215223) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 402844765 + ... + 402848314.
It is an arithmetic number, because the mean of its divisors is an integer number (149858912880).
Almost surely, 21430105215225 is an apocalyptic number.
It is an amenable number.
1430105215225 is a deficient number, since it is larger than the sum of its proper divisors (368201739335).
1430105215225 is an equidigital number, since it uses as much as digits as its factorization.
1430105215225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 805693160 (or 805693155 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 31.
The spelling of 1430105215225 in words is "one trillion, four hundred thirty billion, one hundred five million, two hundred fifteen thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.105 sec. • engine limits •