Base | Representation |
---|---|
bin | 111100101000111101… |
… | …0000110001100111101 |
3 | 110110010110221010202112 |
4 | 1321101322012030331 |
5 | 4113144120000013 |
6 | 135453531103405 |
7 | 12260023651232 |
oct | 1712172061475 |
9 | 413113833675 |
10 | 130223203133 |
11 | 5025566aa31 |
12 | 212a35a1b65 |
13 | c3841c41aa |
14 | 6434dab789 |
15 | 35c2752ba8 |
hex | 1e51e8633d |
130223203133 has 2 divisors, whose sum is σ = 130223203134. Its totient is φ = 130223203132.
The previous prime is 130223203109. The next prime is 130223203139. The reversal of 130223203133 is 331302322031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111127556164 + 19095646969 = 333358^2 + 138187^2 .
It is an emirp because it is prime and its reverse (331302322031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130223203133 - 224 = 130206425917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130223203099 and 130223203108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130223203139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65111601566 + 65111601567.
It is an arithmetic number, because the mean of its divisors is an integer number (65111601567).
Almost surely, 2130223203133 is an apocalyptic number.
It is an amenable number.
130223203133 is a deficient number, since it is larger than the sum of its proper divisors (1).
130223203133 is an equidigital number, since it uses as much as digits as its factorization.
130223203133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 130223203133 its reverse (331302322031), we get a palindrome (461525525164).
The spelling of 130223203133 in words is "one hundred thirty billion, two hundred twenty-three million, two hundred three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •