Base | Representation |
---|---|
bin | 10101010000001100… |
… | …01010100111001101 |
3 | 1002110012011022112001 |
4 | 22220012022213031 |
5 | 141331442420323 |
6 | 5124114312301 |
7 | 552516306226 |
oct | 125006124715 |
9 | 32405138461 |
10 | 11410123213 |
11 | 49257984a5 |
12 | 2265288691 |
13 | 10caba18c8 |
14 | 7a354c24d |
15 | 46baa23ad |
hex | 2a818a9cd |
11410123213 has 4 divisors (see below), whose sum is σ = 11652891840. Its totient is φ = 11167354588.
The previous prime is 11410123183. The next prime is 11410123243. The reversal of 11410123213 is 31232101411.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (11410123183) and next prime (11410123243).
It is a cyclic number.
It is not a de Polignac number, because 11410123213 - 217 = 11409992141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11410123243) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 121384243 + ... + 121384336.
It is an arithmetic number, because the mean of its divisors is an integer number (2913222960).
Almost surely, 211410123213 is an apocalyptic number.
It is an amenable number.
11410123213 is a deficient number, since it is larger than the sum of its proper divisors (242768627).
11410123213 is an equidigital number, since it uses as much as digits as its factorization.
11410123213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242768626.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 11410123213 its reverse (31232101411), we get a palindrome (42642224624).
The spelling of 11410123213 in words is "eleven billion, four hundred ten million, one hundred twenty-three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •