Base | Representation |
---|---|
bin | 100111101101001010… |
… | …100001001111001001 |
3 | 11002001012202111112121 |
4 | 213231022201033021 |
5 | 1144303204212213 |
6 | 31330255211241 |
7 | 3036334105564 |
oct | 475512411711 |
9 | 132035674477 |
10 | 42633663433 |
11 | 17098656399 |
12 | 8319b16b21 |
13 | 40358b0aaa |
14 | 20c62934db |
15 | 1197d1688d |
hex | 9ed2a13c9 |
42633663433 has 2 divisors, whose sum is σ = 42633663434. Its totient is φ = 42633663432.
The previous prime is 42633663403. The next prime is 42633663463. The reversal of 42633663433 is 33436633624.
42633663433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (42633663403) and next prime (42633663463).
It can be written as a sum of positive squares in only one way, i.e., 41905365264 + 728298169 = 204708^2 + 26987^2 .
It is a cyclic number.
It is not a de Polignac number, because 42633663433 - 29 = 42633662921 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 42633663433.
It is not a weakly prime, because it can be changed into another prime (42633663403) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21316831716 + 21316831717.
It is an arithmetic number, because the mean of its divisors is an integer number (21316831717).
Almost surely, 242633663433 is an apocalyptic number.
It is an amenable number.
42633663433 is a deficient number, since it is larger than the sum of its proper divisors (1).
42633663433 is an equidigital number, since it uses as much as digits as its factorization.
42633663433 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1679616, while the sum is 43.
The spelling of 42633663433 in words is "forty-two billion, six hundred thirty-three million, six hundred sixty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •