Base | Representation |
---|---|
bin | 100000111100011… |
… | …1110000101101111 |
3 | 2212001002212000101 |
4 | 1001320332011233 |
5 | 4230444002143 |
6 | 301405411531 |
7 | 36252125164 |
oct | 10170760557 |
9 | 2761085011 |
10 | 1105453423 |
11 | 517aaa578 |
12 | 26a269ba7 |
13 | 14803cc69 |
14 | a6b5c06b |
15 | 670b1b4d |
hex | 41e3e16f |
1105453423 has 2 divisors, whose sum is σ = 1105453424. Its totient is φ = 1105453422.
The previous prime is 1105453409. The next prime is 1105453451. The reversal of 1105453423 is 3243545011.
It is an a-pointer prime, because the next prime (1105453451) can be obtained adding 1105453423 to its sum of digits (28).
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1105453423 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1105453391 and 1105453400.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1105453493) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 552726711 + 552726712.
It is an arithmetic number, because the mean of its divisors is an integer number (552726712).
Almost surely, 21105453423 is an apocalyptic number.
1105453423 is a deficient number, since it is larger than the sum of its proper divisors (1).
1105453423 is an equidigital number, since it uses as much as digits as its factorization.
1105453423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7200, while the sum is 28.
The square root of 1105453423 is about 33248.3597039012. The cubic root of 1105453423 is about 1033.9832011183.
Adding to 1105453423 its reverse (3243545011), we get a palindrome (4348998434).
The spelling of 1105453423 in words is "one billion, one hundred five million, four hundred fifty-three thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •