Base | Representation |
---|---|
bin | 10001100110111010001… |
… | …110101101110011110001 |
3 | 11021200020200201111000202 |
4 | 101212322032231303301 |
5 | 124311100104330001 |
6 | 2323512050324545 |
7 | 153264116153036 |
oct | 21467216556361 |
9 | 4250220644022 |
10 | 1210010230001 |
11 | 427187259051 |
12 | 176611b89755 |
13 | 8a146447621 |
14 | 427c9b9138d |
15 | 2171d91996b |
hex | 119ba3adcf1 |
1210010230001 has 12 divisors (see below), whose sum is σ = 1292034218412. Its totient is φ = 1132932415488.
The previous prime is 1210010229997. The next prime is 1210010230021. The reversal of 1210010230001 is 1000320100121.
It can be written as a sum of positive squares in 6 ways, for example, as 10983040000 + 1199027190001 = 104800^2 + 1095001^2 .
It is not a de Polignac number, because 1210010230001 - 22 = 1210010229997 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1210010230021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10791080 + ... + 10902633.
It is an arithmetic number, because the mean of its divisors is an integer number (107669518201).
Almost surely, 21210010230001 is an apocalyptic number.
It is an amenable number.
1210010230001 is a deficient number, since it is larger than the sum of its proper divisors (82023988411).
1210010230001 is a wasteful number, since it uses less digits than its factorization.
1210010230001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21693940 (or 21693923 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 11.
Adding to 1210010230001 its reverse (1000320100121), we get a palindrome (2210330330122).
The spelling of 1210010230001 in words is "one trillion, two hundred ten billion, ten million, two hundred thirty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •