Base | Representation |
---|---|
bin | 10100111000010110… |
… | …01110111110011111 |
3 | 1001221020211100211210 |
4 | 22130023032332133 |
5 | 140424243001330 |
6 | 5052211515503 |
7 | 544540330542 |
oct | 123413167637 |
9 | 31836740753 |
10 | 11210125215 |
11 | 4832906aa3 |
12 | 220a2b8b93 |
13 | 10986184b3 |
14 | 784b6a859 |
15 | 4592488b0 |
hex | 29c2cef9f |
11210125215 has 16 divisors (see below), whose sum is σ = 17984295648. Its totient is φ = 5962701696.
The previous prime is 11210125211. The next prime is 11210125217. The reversal of 11210125215 is 51252101211.
It is not a de Polignac number, because 11210125215 - 22 = 11210125211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11210125191 and 11210125200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11210125211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 996204 + ... + 1007393.
It is an arithmetic number, because the mean of its divisors is an integer number (1124018478).
Almost surely, 211210125215 is an apocalyptic number.
11210125215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
11210125215 is a deficient number, since it is larger than the sum of its proper divisors (6774170433).
11210125215 is a wasteful number, since it uses less digits than its factorization.
11210125215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2003978.
The product of its (nonzero) digits is 200, while the sum is 21.
Adding to 11210125215 its reverse (51252101211), we get a palindrome (62462226426).
The spelling of 11210125215 in words is "eleven billion, two hundred ten million, one hundred twenty-five thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •