Base | Representation |
---|---|
bin | 1001000110001001011010… |
… | …0101010010011010001100 |
3 | 1022102002212112110220121120 |
4 | 2101202112211102122030 |
5 | 2302324434304102340 |
6 | 33134254220200540 |
7 | 2051364212146050 |
oct | 221422645223214 |
9 | 38362775426546 |
10 | 10001210222220 |
11 | 3206542491978 |
12 | 1156375099150 |
13 | 577157abb749 |
14 | 2680bdb5dc60 |
15 | 12524b2ec4d0 |
hex | 9189695268c |
10001210222220 has 192 divisors, whose sum is σ = 35669951493120. Its totient is φ = 2038282887168.
The previous prime is 10001210222209. The next prime is 10001210222243. The reversal of 10001210222220 is 2222201210001.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 10001210222220.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 36725649 + ... + 36996968.
It is an arithmetic number, because the mean of its divisors is an integer number (185780997360).
Almost surely, 210001210222220 is an apocalyptic number.
10001210222220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10001210222220 is an abundant number, since it is smaller than the sum of its proper divisors (25668741270900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001210222220 is a wasteful number, since it uses less digits than its factorization.
10001210222220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73722672 (or 73722670 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 10001210222220 its reverse (2222201210001), we get a palindrome (12223411432221).
The spelling of 10001210222220 in words is "ten trillion, one billion, two hundred ten million, two hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.075 sec. • engine limits •