Base | Representation |
---|---|
bin | 1001001000000101001101… |
… | …0000011001110001001001 |
3 | 1022112021122101221110122211 |
4 | 2102001103100121301021 |
5 | 2303401013221142413 |
6 | 33201431442345121 |
7 | 2053651534124356 |
oct | 222012320316111 |
9 | 38467571843584 |
10 | 10034440412233 |
11 | 3219645019526 |
12 | 11608a995b1a1 |
13 | 57a322462983 |
14 | 2699531b162d |
15 | 1260437d983d |
hex | 92053419c49 |
10034440412233 has 2 divisors, whose sum is σ = 10034440412234. Its totient is φ = 10034440412232.
The previous prime is 10034440412219. The next prime is 10034440412261. The reversal of 10034440412233 is 33221404443001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7217319861049 + 2817120551184 = 2686507^2 + 1678428^2 .
It is a cyclic number.
It is not a de Polignac number, because 10034440412233 - 25 = 10034440412201 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10034440412195 and 10034440412204.
It is not a weakly prime, because it can be changed into another prime (10034440412203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5017220206116 + 5017220206117.
It is an arithmetic number, because the mean of its divisors is an integer number (5017220206117).
Almost surely, 210034440412233 is an apocalyptic number.
It is an amenable number.
10034440412233 is a deficient number, since it is larger than the sum of its proper divisors (1).
10034440412233 is an equidigital number, since it uses as much as digits as its factorization.
10034440412233 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 27648, while the sum is 31.
Adding to 10034440412233 its reverse (33221404443001), we get a palindrome (43255844855234).
The spelling of 10034440412233 in words is "ten trillion, thirty-four billion, four hundred forty million, four hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •