Base | Representation |
---|---|
bin | 10110111110000100000100… |
… | …101000010011100110011000 |
3 | 111020200121110010002201200120 |
4 | 112332010010220103212120 |
5 | 101220121030340202440 |
6 | 554504511231233240 |
7 | 30164412264113163 |
oct | 2676040450234630 |
9 | 436617403081616 |
10 | 101022003444120 |
11 | 2a209211340330 |
12 | b3b68a8678820 |
13 | 444a445b9b2b5 |
14 | 1ad36c3654ada |
15 | ba2c32ae4dd0 |
hex | 5be104a13998 |
101022003444120 has 128 divisors (see below), whose sum is σ = 332528550186240. Its totient is φ = 24348620848640.
The previous prime is 101022003444073. The next prime is 101022003444157. The reversal of 101022003444120 is 21444300220101.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
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, 220961874 + ... + 221418593.
It is an arithmetic number, because the mean of its divisors is an integer number (2597879298330).
Almost surely, 2101022003444120 is an apocalyptic number.
101022003444120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101022003444120 is an abundant number, since it is smaller than the sum of its proper divisors (231506546742120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101022003444120 is a wasteful number, since it uses less digits than its factorization.
101022003444120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 442380665 (or 442380661 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 24.
Adding to 101022003444120 its reverse (21444300220101), we get a palindrome (122466303664221).
The spelling of 101022003444120 in words is "one hundred one trillion, twenty-two billion, three million, four hundred forty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •