Base | Representation |
---|---|
bin | 1010010001110111001111… |
… | …1001100000100111011111 |
3 | 1111000110110001100112212121 |
4 | 2210131303321200213133 |
5 | 2440133000333131143 |
6 | 40012022500443411 |
7 | 2244354115626424 |
oct | 244356371404737 |
9 | 44013401315777 |
10 | 11302003411423 |
11 | 366817531292a |
12 | 13264a20a9567 |
13 | 63ca0b3229ba |
14 | 2b103c7bdd4b |
15 | 148eceba17ed |
hex | a4773e609df |
11302003411423 has 2 divisors, whose sum is σ = 11302003411424. Its totient is φ = 11302003411422.
The previous prime is 11302003411421. The next prime is 11302003411429. The reversal of 11302003411423 is 32411430020311.
It is a weak prime.
It is an emirp because it is prime and its reverse (32411430020311) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11302003411423 - 21 = 11302003411421 is a prime.
It is a super-2 number, since 2×113020034114232 (a number of 27 digits) contains 22 as substring.
Together with 11302003411421, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11302003411421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5651001705711 + 5651001705712.
It is an arithmetic number, because the mean of its divisors is an integer number (5651001705712).
Almost surely, 211302003411423 is an apocalyptic number.
11302003411423 is a deficient number, since it is larger than the sum of its proper divisors (1).
11302003411423 is an equidigital number, since it uses as much as digits as its factorization.
11302003411423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 11302003411423 its reverse (32411430020311), we get a palindrome (43713433431734).
The spelling of 11302003411423 in words is "eleven trillion, three hundred two billion, three million, four hundred eleven thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •