Base | Representation |
---|---|
bin | 10100111001000001… |
… | …00011000010110001 |
3 | 1001221122100020001210 |
4 | 22130200203002301 |
5 | 140432210244213 |
6 | 5052531350333 |
7 | 544635661032 |
oct | 123440430261 |
9 | 31848306053 |
10 | 11215712433 |
11 | 4835a82832 |
12 | 22101523a9 |
13 | 1099823643 |
14 | 7857c2a89 |
15 | 45999e0c3 |
hex | 29c8230b1 |
11215712433 has 16 divisors (see below), whose sum is σ = 15610674816. Its totient is φ = 7149204480.
The previous prime is 11215712423. The next prime is 11215712441. The reversal of 11215712433 is 33421751211.
It is not a de Polignac number, because 11215712433 - 212 = 11215708337 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11215712433.
It is not an unprimeable number, because it can be changed into a prime (11215712423) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 149841 + ... + 211857.
It is an arithmetic number, because the mean of its divisors is an integer number (975667176).
Almost surely, 211215712433 is an apocalyptic number.
It is an amenable number.
11215712433 is a deficient number, since it is larger than the sum of its proper divisors (4394962383).
11215712433 is a wasteful number, since it uses less digits than its factorization.
11215712433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64664.
The product of its digits is 5040, while the sum is 30.
The spelling of 11215712433 in words is "eleven billion, two hundred fifteen million, seven hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •