Base | Representation |
---|---|
bin | 10001011110100001110… |
… | …001111100101100010011 |
3 | 11020211000110101120002000 |
4 | 101132201301330230103 |
5 | 124134132041213021 |
6 | 2315423022325043 |
7 | 152525102263650 |
oct | 21364161745423 |
9 | 4224013346060 |
10 | 1201010101011 |
11 | 423388989a16 |
12 | 17491ba29783 |
13 | 89340950706 |
14 | 421b4744c27 |
15 | 21393714b26 |
hex | 117a1c7cb13 |
1201010101011 has 64 divisors (see below), whose sum is σ = 2059256908800. Its totient is φ = 677594239488.
The previous prime is 1201010101007. The next prime is 1201010101037. The reversal of 1201010101011 is 1101010101021.
It is not a de Polignac number, because 1201010101011 - 22 = 1201010101007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1201010100984 and 1201010101002.
It is not an unprimeable number, because it can be changed into a prime (1201010101111) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 25656235 + ... + 25703003.
It is an arithmetic number, because the mean of its divisors is an integer number (32175889200).
Almost surely, 21201010101011 is an apocalyptic number.
1201010101011 is a deficient number, since it is larger than the sum of its proper divisors (858246807789).
1201010101011 is a wasteful number, since it uses less digits than its factorization.
1201010101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48505 (or 48499 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 1201010101011 its reverse (1101010101021), we get a palindrome (2302020202032).
It can be divided in two parts, 12010101010 and 11, that added together give a palindrome (12010101021).
The spelling of 1201010101011 in words is "one trillion, two hundred one billion, ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •