Base | Representation |
---|---|
bin | 10111000000101011101101… |
… | …010101010000101110111000 |
3 | 111021022211001110122020110121 |
4 | 113000223231111100232320 |
5 | 101231043144301431404 |
6 | 555123320232023024 |
7 | 30213413634604615 |
oct | 2700535525205670 |
9 | 437284043566417 |
10 | 101202001202104 |
11 | 2a278589391000 |
12 | b425761531a74 |
13 | 44614002091ba |
14 | 1adc2bb02950c |
15 | ba776a008e54 |
hex | 5c0aed550bb8 |
101202001202104 has 64 divisors (see below), whose sum is σ = 208722677230080. Its totient is φ = 45999189148000.
The previous prime is 101202001202089. The next prime is 101202001202173. The reversal of 101202001202104 is 401202100202101.
It is a super-2 number, since 2×1012020012021042 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 309938529 + ... + 310264879.
It is an arithmetic number, because the mean of its divisors is an integer number (3261291831720).
Almost surely, 2101202001202104 is an apocalyptic number.
It is an amenable number.
101202001202104 is an abundant number, since it is smaller than the sum of its proper divisors (107520676027976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101202001202104 is a wasteful number, since it uses less digits than its factorization.
101202001202104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 355513 (or 355487 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 101202001202104 its reverse (401202100202101), we get a palindrome (502404101404205).
The spelling of 101202001202104 in words is "one hundred one trillion, two hundred two billion, one million, two hundred two thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •