Base | Representation |
---|---|
bin | 11101101100001000000… |
… | …01000110011001010000 |
3 | 10121112010001202112121010 |
4 | 32312010001012121100 |
5 | 113203202231130000 |
6 | 2100345421330520 |
7 | 133462402015041 |
oct | 16660401063120 |
9 | 3545101675533 |
10 | 1020122130000 |
11 | 3636a4390aa6 |
12 | 145858a06a40 |
13 | 75274064a3c |
14 | 37534a408c8 |
15 | 1b8080a8d50 |
hex | ed84046650 |
1020122130000 has 100 divisors (see below), whose sum is σ = 3293090348768. Its totient is φ = 272032560000.
The previous prime is 1020122129981. The next prime is 1020122130019. The reversal of 1020122130000 is 312210201.
It is an interprime number because it is at equal distance from previous prime (1020122129981) and next prime (1020122130019).
It is a tau number, because it is divible by the number of its divisors (100).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 16972036 + ... + 17032035.
Almost surely, 21020122130000 is an apocalyptic number.
1020122130000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1020122130000 is an abundant number, since it is smaller than the sum of its proper divisors (2272968218768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1020122130000 is an equidigital number, since it uses as much as digits as its factorization.
1020122130000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34004102 (or 34004081 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 1020122130000 its reverse (312210201), we get a palindrome (1020434340201).
The spelling of 1020122130000 in words is "one trillion, twenty billion, one hundred twenty-two million, one hundred thirty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •