Base | Representation |
---|---|
bin | 1101101111100111001010… |
… | …00100010010111001011101 |
3 | 10222000022110001222021201212 |
4 | 12313303211010102321131 |
5 | 12430134140122044401 |
6 | 144140210033114205 |
7 | 6236361613534145 |
oct | 667634504227135 |
9 | 128008401867655 |
10 | 30223233003101 |
11 | 96a2668126366 |
12 | 348156b6b8965 |
13 | 13b3066b8b728 |
14 | 766b52c8d925 |
15 | 376297c35dbb |
hex | 1b7ce5112e5d |
30223233003101 has 2 divisors, whose sum is σ = 30223233003102. Its totient is φ = 30223233003100.
The previous prime is 30223233003083. The next prime is 30223233003127. The reversal of 30223233003101 is 10130033232203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21423104820100 + 8800128183001 = 4628510^2 + 2966501^2 .
It is an emirp because it is prime and its reverse (10130033232203) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 30223233003101 - 26 = 30223233003037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (30223233003001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 15111616501550 + 15111616501551.
It is an arithmetic number, because the mean of its divisors is an integer number (15111616501551).
Almost surely, 230223233003101 is an apocalyptic number.
It is an amenable number.
30223233003101 is a deficient number, since it is larger than the sum of its proper divisors (1).
30223233003101 is an equidigital number, since it uses as much as digits as its factorization.
30223233003101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 30223233003101 its reverse (10130033232203), we get a palindrome (40353266235304).
The spelling of 30223233003101 in words is "thirty trillion, two hundred twenty-three billion, two hundred thirty-three million, three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •