Base | Representation |
---|---|
bin | 11101011001010110011… |
… | …00111101101110111001 |
3 | 10120120002120110122210221 |
4 | 32230223030331232321 |
5 | 113022031241232213 |
6 | 2052001300140041 |
7 | 132654533322664 |
oct | 16545314755671 |
9 | 3516076418727 |
10 | 1010042133433 |
11 | 35a3a14a8423 |
12 | 143905097621 |
13 | 74328918928 |
14 | 36c5a0166db |
15 | 1b41819838d |
hex | eb2b33dbb9 |
1010042133433 has 2 divisors, whose sum is σ = 1010042133434. Its totient is φ = 1010042133432.
The previous prime is 1010042133413. The next prime is 1010042133509. The reversal of 1010042133433 is 3343312400101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 856720550464 + 153321582969 = 925592^2 + 391563^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010042133433 - 221 = 1010040036281 is a prime.
It is a super-2 number, since 2×10100421334332 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1010042133398 and 1010042133407.
It is not a weakly prime, because it can be changed into another prime (1010042133413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 505021066716 + 505021066717.
It is an arithmetic number, because the mean of its divisors is an integer number (505021066717).
Almost surely, 21010042133433 is an apocalyptic number.
It is an amenable number.
1010042133433 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010042133433 is an equidigital number, since it uses as much as digits as its factorization.
1010042133433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 1010042133433 its reverse (3343312400101), we get a palindrome (4353354533534).
The spelling of 1010042133433 in words is "one trillion, ten billion, forty-two million, one hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •