Base | Representation |
---|---|
bin | 10100110001011111011… |
… | …010101111101010100010 |
3 | 12001110201000112010102120 |
4 | 110301133122233222202 |
5 | 141342040134120040 |
6 | 3011444225525110 |
7 | 205064344460664 |
oct | 24613732575242 |
9 | 5043630463376 |
10 | 1427529988770 |
11 | 500459510326 |
12 | 1b07b8aa3796 |
13 | a480033c662 |
14 | 4d1429ac534 |
15 | 271eeed37d0 |
hex | 14c5f6afaa2 |
1427529988770 has 32 divisors (see below), whose sum is σ = 3490714844352. Its totient is φ = 373492122432.
The previous prime is 1427529988769. The next prime is 1427529988813. The reversal of 1427529988770 is 778899257241.
It is a happy number.
It is a super-2 number, since 2×14275299887702 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1427529988695 and 1427529988704.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 448907212 + ... + 448910391.
It is an arithmetic number, because the mean of its divisors is an integer number (109084838886).
Almost surely, 21427529988770 is an apocalyptic number.
1427529988770 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1427529988770 is an abundant number, since it is smaller than the sum of its proper divisors (2063184855582).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1427529988770 is a wasteful number, since it uses less digits than its factorization.
1427529988770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 897817666.
The product of its (nonzero) digits is 142248960, while the sum is 69.
The spelling of 1427529988770 in words is "one trillion, four hundred twenty-seven billion, five hundred twenty-nine million, nine hundred eighty-eight thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •