Base | Representation |
---|---|
bin | 11101011011001001110… |
… | …01011101111111011010 |
3 | 10120122121000212111222100 |
4 | 32231210321131333122 |
5 | 113031022041214320 |
6 | 2052241315104230 |
7 | 133020526032324 |
oct | 16554471357732 |
9 | 3518530774870 |
10 | 1011010101210 |
11 | 35a84893299a |
12 | 143b352a2076 |
13 | 7445131bb25 |
14 | 36d0c7c6614 |
15 | 1b47314d790 |
hex | eb64e5dfda |
1011010101210 has 48 divisors (see below), whose sum is σ = 2699670225096. Its totient is φ = 262316133504.
The previous prime is 1011010101203. The next prime is 1011010101289. The reversal of 1011010101210 is 121010101101.
It can be written as a sum of positive squares in 4 ways, for example, as 696211678449 + 314798422761 = 834393^2 + 561069^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1011010101192 and 1011010101201.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 151799989 + ... + 151806648.
Almost surely, 21011010101210 is an apocalyptic number.
1011010101210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1011010101210 is an abundant number, since it is smaller than the sum of its proper divisors (1688660123886).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1011010101210 is a wasteful number, since it uses less digits than its factorization.
1011010101210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 303606687 (or 303606684 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1011010101210 its reverse (121010101101), we get a palindrome (1132020202311).
The spelling of 1011010101210 in words is "one trillion, eleven billion, ten million, one hundred one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •