Base | Representation |
---|---|
bin | 11101101011111010101… |
… | …10001000000001111011 |
3 | 10121111211021010222011102 |
4 | 32311331112020001323 |
5 | 113202440102414321 |
6 | 2100330342322015 |
7 | 133456542441041 |
oct | 16657526100173 |
9 | 3544737128142 |
10 | 1020010201211 |
11 | 363647192271 |
12 | 14582742930b |
13 | 75256b057a1 |
14 | 37523c26391 |
15 | 1b7ed349c0b |
hex | ed7d58807b |
1020010201211 has 8 divisors (see below), whose sum is σ = 1055265031200. Its totient is φ = 984760842240.
The previous prime is 1020010201201. The next prime is 1020010201219. The reversal of 1020010201211 is 1121020100201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1020010201211 - 222 = 1020006006907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020010201192 and 1020010201201.
It is not an unprimeable number, because it can be changed into a prime (1020010201219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 986630 + ... + 1735931.
It is an arithmetic number, because the mean of its divisors is an integer number (131908128900).
Almost surely, 21020010201211 is an apocalyptic number.
1020010201211 is a deficient number, since it is larger than the sum of its proper divisors (35254829989).
1020010201211 is a wasteful number, since it uses less digits than its factorization.
1020010201211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2735509.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1020010201211 its reverse (1121020100201), we get a palindrome (2141030301412).
It can be divided in two parts, 1020010 and 201211, that added together give a palindrome (1221221).
The spelling of 1020010201211 in words is "one trillion, twenty billion, ten million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •