Base | Representation |
---|---|
bin | 1000010010111010000… |
… | …0100110111001010110 |
3 | 111121212001122112001210 |
4 | 2010232200212321112 |
5 | 4313332120030010 |
6 | 145245314202250 |
7 | 13203430613415 |
oct | 2045640467126 |
9 | 447761575053 |
10 | 142514220630 |
11 | 55492620331 |
12 | 23753883386 |
13 | 10592730102 |
14 | 6c7d50147c |
15 | 3a9180ab20 |
hex | 212e826e56 |
142514220630 has 64 divisors (see below), whose sum is σ = 357263861760. Its totient is φ = 36337047936.
The previous prime is 142514220539. The next prime is 142514220631. The reversal of 142514220630 is 36022415241.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (142514220631) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 705582 + ... + 884801.
It is an arithmetic number, because the mean of its divisors is an integer number (5582247840).
Almost surely, 2142514220630 is an apocalyptic number.
142514220630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
142514220630 is an abundant number, since it is smaller than the sum of its proper divisors (214749641130).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
142514220630 is a wasteful number, since it uses less digits than its factorization.
142514220630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1590525.
The product of its (nonzero) digits is 11520, while the sum is 30.
Adding to 142514220630 its reverse (36022415241), we get a palindrome (178536635871).
The spelling of 142514220630 in words is "one hundred forty-two billion, five hundred fourteen million, two hundred twenty thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •