Base | Representation |
---|---|
bin | 1010000001101011101001… |
… | …1100001110000000001101 |
3 | 1110000212220111022100210002 |
4 | 2200122322130032000031 |
5 | 2421104140043303401 |
6 | 35240210115454045 |
7 | 2215313226154055 |
oct | 240327234160015 |
9 | 43025814270702 |
10 | 11024014041101 |
11 | 3570292592476 |
12 | 12a063bbb7325 |
13 | 61c7385c8429 |
14 | 2a17ca9c8565 |
15 | 141b5ea20a6b |
hex | a06ba70e00d |
11024014041101 has 2 divisors, whose sum is σ = 11024014041102. Its totient is φ = 11024014041100.
The previous prime is 11024014041097. The next prime is 11024014041121. The reversal of 11024014041101 is 10114041042011.
It is an a-pointer prime, because the next prime (11024014041121) can be obtained adding 11024014041101 to its sum of digits (20).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 11019544984900 + 4469056201 = 3319570^2 + 66851^2 .
It is a cyclic number.
It is not a de Polignac number, because 11024014041101 - 22 = 11024014041097 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11024014041121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5512007020550 + 5512007020551.
It is an arithmetic number, because the mean of its divisors is an integer number (5512007020551).
Almost surely, 211024014041101 is an apocalyptic number.
It is an amenable number.
11024014041101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11024014041101 is an equidigital number, since it uses as much as digits as its factorization.
11024014041101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 11024014041101 its reverse (10114041042011), we get a palindrome (21138055083112).
The spelling of 11024014041101 in words is "eleven trillion, twenty-four billion, fourteen million, forty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •