Base | Representation |
---|---|
bin | 1001001101001100001000… |
… | …1100110111001011010100 |
3 | 1022211200011121011101021112 |
4 | 2103103002030313023110 |
5 | 2311320231440213022 |
6 | 33310024110434152 |
7 | 2063206402512650 |
oct | 223230214671324 |
9 | 38750147141245 |
10 | 10122201101012 |
11 | 325288a6aa990 |
12 | 1175900802958 |
13 | 58569a36b410 |
14 | 26dcba91ba60 |
15 | 12847d2818e2 |
hex | 934c23372d4 |
10122201101012 has 96 divisors (see below), whose sum is σ = 24817704597504. Its totient is φ = 3482075836800.
The previous prime is 10122201100939. The next prime is 10122201101017. The reversal of 10122201101012 is 21010110222101.
It is a super-3 number, since 3×101222011010123 (a number of 40 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10122201101017) 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, 54864914 + ... + 55049097.
It is an arithmetic number, because the mean of its divisors is an integer number (258517756224).
Almost surely, 210122201101012 is an apocalyptic number.
It is an amenable number.
10122201101012 is an abundant number, since it is smaller than the sum of its proper divisors (14695503496492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10122201101012 is a wasteful number, since it uses less digits than its factorization.
10122201101012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 109914069 (or 109914067 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 10122201101012 its reverse (21010110222101), we get a palindrome (31132311323113).
The spelling of 10122201101012 in words is "ten trillion, one hundred twenty-two billion, two hundred one million, one hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •