Base | Representation |
---|---|
bin | 10000000000101001110… |
… | …001101000100111000111 |
3 | 10220011211200221010211110 |
4 | 100000221301220213013 |
5 | 121011213400130111 |
6 | 2201233004140103 |
7 | 142326201663513 |
oct | 20005161504707 |
9 | 3804750833743 |
10 | 1100212505031 |
11 | 394663305192 |
12 | 15928ab37633 |
13 | 7c998b203b3 |
14 | 3b3717c3143 |
15 | 1d94447a5a6 |
hex | 10029c689c7 |
1100212505031 has 8 divisors (see below), whose sum is σ = 1466982730224. Its totient is φ = 733458641600.
The previous prime is 1100212505027. The next prime is 1100212505059. The reversal of 1100212505031 is 1305052120011.
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 1100212505031 - 22 = 1100212505027 is a prime.
It is a super-2 number, since 2×11002125050312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1100212504989 and 1100212505007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100212503031) 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, 3932670 + ... + 4203131.
It is an arithmetic number, because the mean of its divisors is an integer number (183372841278).
Almost surely, 21100212505031 is an apocalyptic number.
1100212505031 is a deficient number, since it is larger than the sum of its proper divisors (366770225193).
1100212505031 is an equidigital number, since it uses as much as digits as its factorization.
1100212505031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8180881.
The product of its (nonzero) digits is 300, while the sum is 21.
Adding to 1100212505031 its reverse (1305052120011), we get a palindrome (2405264625042).
The spelling of 1100212505031 in words is "one trillion, one hundred billion, two hundred twelve million, five hundred five thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •