Base | Representation |
---|---|
bin | 10111000000101010110010… |
… | …010000001010111101101100 |
3 | 111021022201111101112120021110 |
4 | 113000222302100022331230 |
5 | 101231034132030341022 |
6 | 555123034023232020 |
7 | 30213350240615601 |
oct | 2700526220127554 |
9 | 437281441476243 |
10 | 101201010012012 |
11 | 2a27811a935239 |
12 | b4255255a8610 |
13 | 44612a2a64ca1 |
14 | 1adc2255326a8 |
15 | ba770ceb800c |
hex | 5c0ab240af6c |
101201010012012 has 96 divisors (see below), whose sum is σ = 240480498428352. Its totient is φ = 33117367504896.
The previous prime is 101201010012001. The next prime is 101201010012017. The reversal of 101201010012012 is 210210010102101.
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 (101201010012017) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 603463518 + ... + 603631194.
It is an arithmetic number, because the mean of its divisors is an integer number (2505005191962).
Almost surely, 2101201010012012 is an apocalyptic number.
101201010012012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101201010012012 is an abundant number, since it is smaller than the sum of its proper divisors (139279488416340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101201010012012 is a wasteful number, since it uses less digits than its factorization.
101201010012012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170947 (or 170945 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 101201010012012 its reverse (210210010102101), we get a palindrome (311411020114113).
The spelling of 101201010012012 in words is "one hundred one trillion, two hundred one billion, ten million, twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •