Base | Representation |
---|---|
bin | 10100101010100110011… |
… | …001110111010000000101 |
3 | 12000202121101000211102010 |
4 | 110222212121313100011 |
5 | 141231412014133240 |
6 | 3004222120004433 |
7 | 204413112243015 |
oct | 24524631672005 |
9 | 5022541024363 |
10 | 1420131005445 |
11 | 4a8301a25679 |
12 | 1ab293000719 |
13 | a3bc148cb09 |
14 | 4ca40073c45 |
15 | 26e1a657280 |
hex | 14aa6677405 |
1420131005445 has 32 divisors (see below), whose sum is σ = 2351415075840. Its totient is φ = 731124472320.
The previous prime is 1420131005441. The next prime is 1420131005497. The reversal of 1420131005445 is 5445001310241.
It is not a de Polignac number, because 1420131005445 - 22 = 1420131005441 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1420131005441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3661800 + ... + 4031009.
It is an arithmetic number, because the mean of its divisors is an integer number (73481721120).
Almost surely, 21420131005445 is an apocalyptic number.
1420131005445 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1420131005445 is a deficient number, since it is larger than the sum of its proper divisors (931284070395).
1420131005445 is a wasteful number, since it uses less digits than its factorization.
1420131005445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7693245.
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 1420131005445 its reverse (5445001310241), we get a palindrome (6865132315686).
The spelling of 1420131005445 in words is "one trillion, four hundred twenty billion, one hundred thirty-one million, five thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •