Base | Representation |
---|---|
bin | 10100111000100101… |
… | …10101100111001001 |
3 | 1001221101120122002011 |
4 | 22130102311213021 |
5 | 140430300242343 |
6 | 5052322335521 |
7 | 544563302023 |
oct | 123422654711 |
9 | 31841518064 |
10 | 11212118473 |
11 | 4833a48616 |
12 | 220aaba5a1 |
13 | 1098b6583a |
14 | 785129013 |
15 | 4594de29d |
hex | 29c4b59c9 |
11212118473 has 8 divisors (see below), whose sum is σ = 11539824192. Its totient is φ = 10885711536.
The previous prime is 11212118461. The next prime is 11212118509. The reversal of 11212118473 is 37481121211.
11212118473 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 11212118473 - 213 = 11212110281 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11212118773) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 307165 + ... + 341722.
It is an arithmetic number, because the mean of its divisors is an integer number (1442478024).
Almost surely, 211212118473 is an apocalyptic number.
It is an amenable number.
11212118473 is a deficient number, since it is larger than the sum of its proper divisors (327705719).
11212118473 is an equidigital number, since it uses as much as digits as its factorization.
11212118473 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 649391.
The product of its digits is 2688, while the sum is 31.
Adding to 11212118473 its reverse (37481121211), we get a palindrome (48693239684).
The spelling of 11212118473 in words is "eleven billion, two hundred twelve million, one hundred eighteen thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •