Base | Representation |
---|---|
bin | 11101100001010010001… |
… | …11000100001111111000 |
3 | 10120222002110011022100012 |
4 | 32300221013010033320 |
5 | 113104242303000440 |
6 | 2053544112001052 |
7 | 133165230514253 |
oct | 16605107041770 |
9 | 3528073138305 |
10 | 1014302000120 |
11 | 361188044302 |
12 | 1446b3830188 |
13 | 748573259c6 |
14 | 37141a9409a |
15 | 1b5b7150e65 |
hex | ec291c43f8 |
1014302000120 has 32 divisors (see below), whose sum is σ = 2282240685600. Its totient is φ = 405709922688.
The previous prime is 1014302000119. The next prime is 1014302000137. The reversal of 1014302000120 is 210002034101.
It is a junction number, because it is equal to n+sod(n) for n = 1014302000095 and 1014302000104.
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, 1264166 + ... + 1904394.
It is an arithmetic number, because the mean of its divisors is an integer number (71320021425).
Almost surely, 21014302000120 is an apocalyptic number.
1014302000120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1014302000120 is an abundant number, since it is smaller than the sum of its proper divisors (1267938685480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1014302000120 is a wasteful number, since it uses less digits than its factorization.
1014302000120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679847 (or 679843 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 1014302000120 its reverse (210002034101), we get a palindrome (1224304034221).
The spelling of 1014302000120 in words is "one trillion, fourteen billion, three hundred two million, one hundred twenty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •