Base | Representation |
---|---|
bin | 10101010010111011… |
… | …10100010010010001 |
3 | 1002111210101200100012 |
4 | 22221131310102101 |
5 | 141403333203213 |
6 | 5130255004305 |
7 | 553215515216 |
oct | 125135642221 |
9 | 32453350305 |
10 | 11433100433 |
11 | 4937761637 |
12 | 2270b09695 |
13 | 11028881b1 |
14 | 7a660db0d |
15 | 46dae04a8 |
hex | 2a9774491 |
11433100433 has 2 divisors, whose sum is σ = 11433100434. Its totient is φ = 11433100432.
The previous prime is 11433100411. The next prime is 11433100477. The reversal of 11433100433 is 33400133411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8742811009 + 2690289424 = 93503^2 + 51868^2 .
It is an emirp because it is prime and its reverse (33400133411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11433100433 - 210 = 11433099409 is a prime.
It is a super-2 number, since 2×114331004332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11433100399 and 11433100408.
It is not a weakly prime, because it can be changed into another prime (11433100493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5716550216 + 5716550217.
It is an arithmetic number, because the mean of its divisors is an integer number (5716550217).
Almost surely, 211433100433 is an apocalyptic number.
It is an amenable number.
11433100433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11433100433 is an equidigital number, since it uses as much as digits as its factorization.
11433100433 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 11433100433 its reverse (33400133411), we get a palindrome (44833233844).
The spelling of 11433100433 in words is "eleven billion, four hundred thirty-three million, one hundred thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •