Base | Representation |
---|---|
bin | 10100101010100100111… |
… | …011000011011001110000 |
3 | 12000202112122021010020222 |
4 | 110222210323003121300 |
5 | 141231334133322121 |
6 | 3004215431152212 |
7 | 204412361056442 |
oct | 24524473033160 |
9 | 5022478233228 |
10 | 1420106151536 |
11 | 4a829999a556 |
12 | 1ab286815668 |
13 | a3bb929a267 |
14 | 4ca3aa44492 |
15 | 26e183980ab |
hex | 14aa4ec3670 |
1420106151536 has 40 divisors (see below), whose sum is σ = 2840410952064. Its totient is φ = 687100078080.
The previous prime is 1420106151521. The next prime is 1420106151553. The reversal of 1420106151536 is 6351516010241.
It is a junction number, because it is equal to n+sod(n) for n = 1420106151496 and 1420106151505.
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 7594136 + ... + 7778888.
Almost surely, 21420106151536 is an apocalyptic number.
1420106151536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1420106151536 is an abundant number, since it is smaller than the sum of its proper divisors (1420304800528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1420106151536 is a wasteful number, since it uses less digits than its factorization.
1420106151536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200289 (or 200283 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 35.
The spelling of 1420106151536 in words is "one trillion, four hundred twenty billion, one hundred six million, one hundred fifty-one thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •