Base | Representation |
---|---|
bin | 11101011001011111101… |
… | …10000011000011100001 |
3 | 10120120022000000022010100 |
4 | 32230233312003003201 |
5 | 113022211210341001 |
6 | 2052013121253013 |
7 | 132656500302132 |
oct | 16545766030341 |
9 | 3516260008110 |
10 | 1010120012001 |
11 | 35a43145a781 |
12 | 143927194169 |
13 | 7433bab5519 |
14 | 36c664c9c89 |
15 | 1b41ee2d586 |
hex | eb2fd830e1 |
1010120012001 has 12 divisors (see below), whose sum is σ = 1459337136660. Its totient is φ = 673286465760.
The previous prime is 1010120011997. The next prime is 1010120012009. The reversal of 1010120012001 is 1002100210101.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 99385715025 + 910734296976 = 315255^2 + 954324^2 .
It is not a de Polignac number, because 1010120012001 - 22 = 1010120011997 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 (1010120012009) 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, 10522530 + ... + 10618091.
It is an arithmetic number, because the mean of its divisors is an integer number (121611428055).
Almost surely, 21010120012001 is an apocalyptic number.
It is an amenable number.
1010120012001 is a deficient number, since it is larger than the sum of its proper divisors (449217124659).
1010120012001 is a wasteful number, since it uses less digits than its factorization.
1010120012001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21145936 (or 21145933 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1010120012001 its reverse (1002100210101), we get a palindrome (2012220222102).
The spelling of 1010120012001 in words is "one trillion, ten billion, one hundred twenty million, twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •