Base | Representation |
---|---|
bin | 11101101111110011110… |
… | …10011111101010110001 |
3 | 10121201012220200100001200 |
4 | 32313321322133222301 |
5 | 113221230112010001 |
6 | 2101314000321413 |
7 | 133562410405425 |
oct | 16677172375261 |
9 | 3551186610050 |
10 | 1022100110001 |
11 | 364519958713 |
12 | 14610b313269 |
13 | 754caa9c3c9 |
14 | 37681606b85 |
15 | 1b8c1a6c086 |
hex | edf9e9fab1 |
1022100110001 has 12 divisors (see below), whose sum is σ = 1476407923380. Its totient is φ = 681381105120.
The previous prime is 1022100109981. The next prime is 1022100110029. The reversal of 1022100110001 is 1000110012201.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 759423359601 + 262676750400 = 871449^2 + 512520^2 .
It is not a de Polignac number, because 1022100110001 - 219 = 1022099585713 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1022100110701) 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, 1235446 + ... + 1889583.
It is an arithmetic number, because the mean of its divisors is an integer number (123033993615).
Almost surely, 21022100110001 is an apocalyptic number.
It is an amenable number.
1022100110001 is a deficient number, since it is larger than the sum of its proper divisors (454307813379).
1022100110001 is a wasteful number, since it uses less digits than its factorization.
1022100110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3161376 (or 3161373 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1022100110001 its reverse (1000110012201), we get a palindrome (2022210122202).
The spelling of 1022100110001 in words is "one trillion, twenty-two billion, one hundred million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •