Base | Representation |
---|---|
bin | 10101010101011110… |
… | …00100111010111001 |
3 | 1002120021110220220202 |
4 | 22222233010322321 |
5 | 141424311332413 |
6 | 5132335331545 |
7 | 553564545461 |
oct | 125257047271 |
9 | 32507426822 |
10 | 11454402233 |
11 | 4948790a2a |
12 | 2278080bb5 |
13 | 1107106001 |
14 | 7a9396ba1 |
15 | 4708ebe58 |
hex | 2aabc4eb9 |
11454402233 has 2 divisors, whose sum is σ = 11454402234. Its totient is φ = 11454402232.
The previous prime is 11454402229. The next prime is 11454402299. The reversal of 11454402233 is 33220445411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8572537744 + 2881864489 = 92588^2 + 53683^2 .
It is a cyclic number.
It is not a de Polignac number, because 11454402233 - 22 = 11454402229 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11454402196 and 11454402205.
It is not a weakly prime, because it can be changed into another prime (11454492233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5727201116 + 5727201117.
It is an arithmetic number, because the mean of its divisors is an integer number (5727201117).
Almost surely, 211454402233 is an apocalyptic number.
It is an amenable number.
11454402233 is a deficient number, since it is larger than the sum of its proper divisors (1).
11454402233 is an equidigital number, since it uses as much as digits as its factorization.
11454402233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11520, while the sum is 29.
Adding to 11454402233 its reverse (33220445411), we get a palindrome (44674847644).
The spelling of 11454402233 in words is "eleven billion, four hundred fifty-four million, four hundred two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •