Base | Representation |
---|---|
bin | 1000110100110010101… |
… | …01000000100100100101 |
3 | 1001222122221011200121012 |
4 | 10122121111000210211 |
5 | 14431443323212013 |
6 | 351144123432005 |
7 | 30623035411562 |
oct | 4323125004445 |
9 | 1058587150535 |
10 | 303220132133 |
11 | 10765a950226 |
12 | 4a923985605 |
13 | 22793cc8a39 |
14 | 10966a8b869 |
15 | 7d4a2371a8 |
hex | 4699540925 |
303220132133 has 2 divisors, whose sum is σ = 303220132134. Its totient is φ = 303220132132.
The previous prime is 303220132129. The next prime is 303220132147. The reversal of 303220132133 is 331231022303.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 293175682849 + 10044449284 = 541457^2 + 100222^2 .
It is an emirp because it is prime and its reverse (331231022303) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 303220132133 - 22 = 303220132129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 303220132099 and 303220132108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (303220137133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151610066066 + 151610066067.
It is an arithmetic number, because the mean of its divisors is an integer number (151610066067).
Almost surely, 2303220132133 is an apocalyptic number.
It is an amenable number.
303220132133 is a deficient number, since it is larger than the sum of its proper divisors (1).
303220132133 is an equidigital number, since it uses as much as digits as its factorization.
303220132133 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 303220132133 its reverse (331231022303), we get a palindrome (634451154436).
The spelling of 303220132133 in words is "three hundred three billion, two hundred twenty million, one hundred thirty-two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •