Base | Representation |
---|---|
bin | 10100101010100101010… |
… | …010111001000000010101 |
3 | 12000202120002000121002120 |
4 | 110222211102321000111 |
5 | 141231342233303110 |
6 | 3004220213130153 |
7 | 204412465143636 |
oct | 24524522710025 |
9 | 5022502017076 |
10 | 1420112400405 |
11 | 4a82a2478406 |
12 | 1ab288929959 |
13 | a3bba67760a |
14 | 4ca3b7cd88d |
15 | 26e18bce870 |
hex | 14aa54b9015 |
1420112400405 has 8 divisors (see below), whose sum is σ = 2272179840672. Its totient is φ = 757393280208.
The previous prime is 1420112400397. The next prime is 1420112400467. The reversal of 1420112400405 is 5040042110241.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1420112400405 - 23 = 1420112400397 is a prime.
It is a Curzon number.
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, 47337079999 + ... + 47337080028.
It is an arithmetic number, because the mean of its divisors is an integer number (284022480084).
Almost surely, 21420112400405 is an apocalyptic number.
1420112400405 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1420112400405 is a deficient number, since it is larger than the sum of its proper divisors (852067440267).
1420112400405 is an equidigital number, since it uses as much as digits as its factorization.
1420112400405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 94674160035.
The product of its (nonzero) digits is 1280, while the sum is 24.
Adding to 1420112400405 its reverse (5040042110241), we get a palindrome (6460154510646).
The spelling of 1420112400405 in words is "one trillion, four hundred twenty billion, one hundred twelve million, four hundred thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •