Base | Representation |
---|---|
bin | 10101000101110101… |
… | …11101110101100111 |
3 | 1002020010210022010210 |
4 | 22202322331311213 |
5 | 141142231114343 |
6 | 5111333350503 |
7 | 550413321003 |
oct | 124272756547 |
9 | 32203708123 |
10 | 11323301223 |
11 | 4890787893 |
12 | 2240198433 |
13 | 10b5bc3350 |
14 | 795bcb703 |
15 | 464152333 |
hex | 2a2ebdd67 |
11323301223 has 16 divisors (see below), whose sum is σ = 16261537376. Its totient is φ = 6967140480.
The previous prime is 11323301203. The next prime is 11323301243. The reversal of 11323301223 is 32210332311.
It is an interprime number because it is at equal distance from previous prime (11323301203) and next prime (11323301243).
It is not a de Polignac number, because 11323301223 - 25 = 11323301191 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11323301223.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11323301203) 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, 302961 + ... + 338277.
It is an arithmetic number, because the mean of its divisors is an integer number (1016346086).
Almost surely, 211323301223 is an apocalyptic number.
11323301223 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
11323301223 is a deficient number, since it is larger than the sum of its proper divisors (4938236153).
11323301223 is a wasteful number, since it uses less digits than its factorization.
11323301223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43554.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 11323301223 its reverse (32210332311), we get a palindrome (43533633534).
The spelling of 11323301223 in words is "eleven billion, three hundred twenty-three million, three hundred one thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •