Base | Representation |
---|---|
bin | 1101110100110010010001… |
… | …10011111111100011111101 |
3 | 10222122022021222010222221101 |
4 | 12322121020303333203331 |
5 | 12441042222012012313 |
6 | 144354005431133101 |
7 | 6255254060160616 |
oct | 672311063774375 |
9 | 128568258128841 |
10 | 30401000110333 |
11 | 9760aa0012116 |
12 | 34abb01514191 |
13 | 13c6a57025a48 |
14 | 7715b82c8c0d |
15 | 37abee3c65dd |
hex | 1ba648cff8fd |
30401000110333 has 2 divisors, whose sum is σ = 30401000110334. Its totient is φ = 30401000110332.
The previous prime is 30401000110309. The next prime is 30401000110343. The reversal of 30401000110333 is 33301100010403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19233820667044 + 11167179443289 = 4385638^2 + 3341733^2 .
It is a cyclic number.
It is not a de Polignac number, because 30401000110333 - 217 = 30400999979261 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 30401000110333.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30401000110343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15200500055166 + 15200500055167.
It is an arithmetic number, because the mean of its divisors is an integer number (15200500055167).
Almost surely, 230401000110333 is an apocalyptic number.
It is an amenable number.
30401000110333 is a deficient number, since it is larger than the sum of its proper divisors (1).
30401000110333 is an equidigital number, since it uses as much as digits as its factorization.
30401000110333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 30401000110333 its reverse (33301100010403), we get a palindrome (63702100120736).
The spelling of 30401000110333 in words is "thirty trillion, four hundred one billion, one hundred ten thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •