Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …101011100000010100001 |
3 | 10220011210220010112001122 |
4 | 100000221011130002201 |
5 | 121011202413403301 |
6 | 2201231511542025 |
7 | 142326001340546 |
oct | 20005105340241 |
9 | 3804726115048 |
10 | 1100200919201 |
11 | 39465781161a |
12 | 15928708a915 |
13 | 7c9965c4a87 |
14 | 3b370048bcd |
15 | 1d94343c81b |
hex | 1002915c0a1 |
1100200919201 has 6 divisors (see below), whose sum is σ = 1127689581606. Its totient is φ = 1073366748800.
The previous prime is 1100200919197. The next prime is 1100200919243. The reversal of 1100200919201 is 1029190020011.
It can be written as a sum of positive squares in 3 ways, for example, as 200994408976 + 899206510225 = 448324^2 + 948265^2 .
It is not a de Polignac number, because 1100200919201 - 22 = 1100200919197 is a prime.
It is a super-2 number, since 2×11002009192012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1100200919291) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 327244280 + ... + 327247641.
It is an arithmetic number, because the mean of its divisors is an integer number (187948263601).
Almost surely, 21100200919201 is an apocalyptic number.
It is an amenable number.
1100200919201 is a deficient number, since it is larger than the sum of its proper divisors (27488662405).
1100200919201 is an frugal number, since it uses more digits than its factorization.
1100200919201 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 654492003 (or 654491962 counting only the distinct ones).
The product of its (nonzero) digits is 324, while the sum is 26.
Adding to 1100200919201 its reverse (1029190020011), we get a palindrome (2129390939212).
The spelling of 1100200919201 in words is "one trillion, one hundred billion, two hundred million, nine hundred nineteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •