Base | Representation |
---|---|
bin | 10011011000011011… |
… | …11101110111111011 |
3 | 222212011211221212121 |
4 | 21230031331313323 |
5 | 132302304111402 |
6 | 4440310422111 |
7 | 515600406253 |
oct | 115415756773 |
9 | 28764757777 |
10 | 10405535227 |
11 | 445a72069a |
12 | 2024961937 |
13 | c9aa19349 |
14 | 709d68963 |
15 | 40d7b6837 |
hex | 26c37ddfb |
10405535227 has 2 divisors, whose sum is σ = 10405535228. Its totient is φ = 10405535226.
The previous prime is 10405535207. The next prime is 10405535233. The reversal of 10405535227 is 72253550401.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10405535227 - 231 = 8258051579 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10405535192 and 10405535201.
It is not a weakly prime, because it can be changed into another prime (10405535207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5202767613 + 5202767614.
It is an arithmetic number, because the mean of its divisors is an integer number (5202767614).
Almost surely, 210405535227 is an apocalyptic number.
10405535227 is a deficient number, since it is larger than the sum of its proper divisors (1).
10405535227 is an equidigital number, since it uses as much as digits as its factorization.
10405535227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 42000, while the sum is 34.
The spelling of 10405535227 in words is "ten billion, four hundred five million, five hundred thirty-five thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •