Base | Representation |
---|---|
bin | 10011100111010000011101… |
… | …10100011001001010110001 |
3 | 12122201012212110211102120121 |
4 | 21303220032310121022301 |
5 | 21123121333402431113 |
6 | 231421442503410241 |
7 | 12041030202535225 |
oct | 1163501664311261 |
9 | 178635773742517 |
10 | 43130310202033 |
11 | 1281950978229a |
12 | 4a06b39753981 |
13 | 1b0b22b32c792 |
14 | a91737b48785 |
15 | 4ebdb964ae8d |
hex | 273a0ed192b1 |
43130310202033 has 2 divisors, whose sum is σ = 43130310202034. Its totient is φ = 43130310202032.
The previous prime is 43130310202003. The next prime is 43130310202081. The reversal of 43130310202033 is 33020201303134.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39639716736064 + 3490593465969 = 6296008^2 + 1868313^2 .
It is a cyclic number.
It is not a de Polignac number, because 43130310202033 - 241 = 40931286946481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 43130310201989 and 43130310202007.
It is not a weakly prime, because it can be changed into another prime (43130310202003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21565155101016 + 21565155101017.
It is an arithmetic number, because the mean of its divisors is an integer number (21565155101017).
Almost surely, 243130310202033 is an apocalyptic number.
It is an amenable number.
43130310202033 is a deficient number, since it is larger than the sum of its proper divisors (1).
43130310202033 is an equidigital number, since it uses as much as digits as its factorization.
43130310202033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 43130310202033 its reverse (33020201303134), we get a palindrome (76150511505167).
The spelling of 43130310202033 in words is "forty-three trillion, one hundred thirty billion, three hundred ten million, two hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •