Base | Representation |
---|---|
bin | 10110111110001011101000… |
… | …100010001101110010100000 |
3 | 111020201101101220122010010010 |
4 | 112332023220202031302200 |
5 | 101220234142214120000 |
6 | 554512333004404520 |
7 | 30165120414633465 |
oct | 2676135042156240 |
9 | 436641356563103 |
10 | 101030122020000 |
11 | 2a2116a8037578 |
12 | b3b8393546740 |
13 | 444b13ab5a054 |
14 | 1ad3c5398766c |
15 | ba305a713d50 |
hex | 5be2e888dca0 |
101030122020000 has 120 divisors (see below), whose sum is σ = 331399006446816. Its totient is φ = 26941365856000.
The previous prime is 101030122019999. The next prime is 101030122020007. The reversal of 101030122020000 is 20221030101.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (101030122020007) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 841857684 + ... + 841977683.
Almost surely, 2101030122020000 is an apocalyptic number.
101030122020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101030122020000 is an abundant number, since it is smaller than the sum of its proper divisors (230368884426816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101030122020000 is an equidigital number, since it uses as much as digits as its factorization.
101030122020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1683835400 (or 1683835377 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 101030122020000 its reverse (20221030101), we get a palindrome (101050343050101).
The spelling of 101030122020000 in words is "one hundred one trillion, thirty billion, one hundred twenty-two million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.132 sec. • engine limits •