Base | Representation |
---|---|
bin | 10100111000011101… |
… | …00100110111011110 |
3 | 1001221022110212121202 |
4 | 22130032210313132 |
5 | 140430004020220 |
6 | 5052242355502 |
7 | 544550640005 |
oct | 123416446736 |
9 | 31838425552 |
10 | 11211001310 |
11 | 4833355243 |
12 | 220a65bb92 |
13 | 10988641b2 |
14 | 784d17c3c |
15 | 45936d275 |
hex | 29c3a4dde |
11211001310 has 32 divisors (see below), whose sum is σ = 20318904000. Its totient is φ = 4453574400.
The previous prime is 11211001303. The next prime is 11211001349. The reversal of 11211001310 is 1310011211.
It is a happy number.
It is a super-2 number, since 2×112110013102 (a number of 21 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11211001291 and 11211001300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1127360 + ... + 1137260.
It is an arithmetic number, because the mean of its divisors is an integer number (634965750).
Almost surely, 211211001310 is an apocalyptic number.
11211001310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11211001310 is a deficient number, since it is larger than the sum of its proper divisors (9107902690).
11211001310 is a wasteful number, since it uses less digits than its factorization.
11211001310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10676.
The product of its (nonzero) digits is 6, while the sum is 11.
Adding to 11211001310 its reverse (1310011211), we get a palindrome (12521012521).
Subtracting from 11211001310 its reverse (1310011211), we obtain a palindrome (9900990099).
The spelling of 11211001310 in words is "eleven billion, two hundred eleven million, one thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •