Base | Representation |
---|---|
bin | 10110111111011111011100… |
… | …111001000101100000010000 |
3 | 111021000222201002121002210202 |
4 | 112333133130321011200100 |
5 | 101223223001434031000 |
6 | 555021535311114332 |
7 | 30204454602440222 |
oct | 2677373471054020 |
9 | 437028632532722 |
10 | 101120121002000 |
11 | 2a246891122841 |
12 | b41190bb129a8 |
13 | 44567816b3b59 |
14 | 1ad835069c412 |
15 | ba557693ddd5 |
hex | 5bf7dce45810 |
101120121002000 has 160 divisors (see below), whose sum is σ = 244974072155904. Its totient is φ = 40371082752000.
The previous prime is 101120121001987. The next prime is 101120121002039. The reversal of 101120121002000 is 200121021101.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2912344640 + ... + 2912379360.
Almost surely, 2101120121002000 is an apocalyptic number.
101120121002000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101120121002000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122487036077952).
101120121002000 is an abundant number, since it is smaller than the sum of its proper divisors (143853951153904).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101120121002000 is a wasteful number, since it uses less digits than its factorization.
101120121002000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37474 (or 37458 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 101120121002000 its reverse (200121021101), we get a palindrome (101320242023101).
The spelling of 101120121002000 in words is "one hundred one trillion, one hundred twenty billion, one hundred twenty-one million, two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •