Base | Representation |
---|---|
bin | 10100101010100001000… |
… | …000101101010110010101 |
3 | 12000202101001202221212010 |
4 | 110222201000231112111 |
5 | 141231220333301310 |
6 | 3004205124414433 |
7 | 204410633210151 |
oct | 24524100552625 |
9 | 5022331687763 |
10 | 1420040525205 |
11 | 4a8265946515 |
12 | 1ab268847419 |
13 | a3ba8800403 |
14 | 4ca32040061 |
15 | 26e12733320 |
hex | 14aa102d595 |
1420040525205 has 8 divisors (see below), whose sum is σ = 2272064840352. Its totient is φ = 757354946768.
The previous prime is 1420040525153. The next prime is 1420040525219. The reversal of 1420040525205 is 5025250400241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1420040525205 - 28 = 1420040524949 is a prime.
It is a congruent number.
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, 47334684159 + ... + 47334684188.
It is an arithmetic number, because the mean of its divisors is an integer number (284008105044).
Almost surely, 21420040525205 is an apocalyptic number.
1420040525205 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1420040525205 is a deficient number, since it is larger than the sum of its proper divisors (852024315147).
1420040525205 is an equidigital number, since it uses as much as digits as its factorization.
1420040525205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94669368355.
The product of its (nonzero) digits is 16000, while the sum is 30.
Adding to 1420040525205 its reverse (5025250400241), we get a palindrome (6445290925446).
The spelling of 1420040525205 in words is "one trillion, four hundred twenty billion, forty million, five hundred twenty-five thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •