Base | Representation |
---|---|
bin | 1001001100000001101000… |
… | …0110100010010000101001 |
3 | 1022202202112202110000211200 |
4 | 2103000122012202100221 |
5 | 2311003301424013001 |
6 | 33252515335114413 |
7 | 2061600646461324 |
oct | 223003206422051 |
9 | 38682482400750 |
10 | 10102201001001 |
11 | 324535711280a |
12 | 1171a5a812a09 |
13 | 58383095a105 |
14 | 26cd4060b7bb |
15 | 127bac4e6086 |
hex | 9301a1a2429 |
10102201001001 has 12 divisors (see below), whose sum is σ = 14592502462980. Its totient is φ = 6734600197920.
The previous prime is 10102201000979. The next prime is 10102201001107. The reversal of 10102201001001 is 10010010220101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 5131312257600 + 4970888743401 = 2265240^2 + 2229549^2 .
It is not a de Polignac number, because 10102201001001 - 213 = 10102200992809 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (10102201001701) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16386310 + ... + 16991631.
It is an arithmetic number, because the mean of its divisors is an integer number (1216041871915).
Almost surely, 210102201001001 is an apocalyptic number.
It is an amenable number.
10102201001001 is a deficient number, since it is larger than the sum of its proper divisors (4490301461979).
10102201001001 is a wasteful number, since it uses less digits than its factorization.
10102201001001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33411576 (or 33411573 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 10102201001001 its reverse (10010010220101), we get a palindrome (20112211221102).
The spelling of 10102201001001 in words is "ten trillion, one hundred two billion, two hundred one million, one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •