Base | Representation |
---|---|
bin | 10111000000111000001101… |
… | …111101100111110001101100 |
3 | 111021101002201120222110200020 |
4 | 113000320031331213301230 |
5 | 101231303201442230202 |
6 | 555133421150002140 |
7 | 30214400540662515 |
oct | 2700701575476154 |
9 | 437332646873606 |
10 | 101215433555052 |
11 | 2a283251619643 |
12 | b42828baa6350 |
13 | 446276103943b |
14 | 1adcbd2d7ba0c |
15 | ba7ca43b05bc |
hex | 5c0e0df67c6c |
101215433555052 has 24 divisors (see below), whose sum is σ = 236173959168000. Its totient is φ = 33737818679376.
The previous prime is 101215433555023. The next prime is 101215433555087. The reversal of 101215433555052 is 250555334512101.
It is a super-2 number, since 2×1012154335550522 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101215433554995 and 101215433555013.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 81756552 + ... + 82985327.
It is an arithmetic number, because the mean of its divisors is an integer number (9840581632000).
Almost surely, 2101215433555052 is an apocalyptic number.
101215433555052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101215433555052 is an abundant number, since it is smaller than the sum of its proper divisors (134958525612948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101215433555052 is a wasteful number, since it uses less digits than its factorization.
101215433555052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164793085 (or 164793083 counting only the distinct ones).
The product of its (nonzero) digits is 450000, while the sum is 42.
The spelling of 101215433555052 in words is "one hundred one trillion, two hundred fifteen billion, four hundred thirty-three million, five hundred fifty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •