Base | Representation |
---|---|
bin | 11110010011000100100111… |
… | …011101100111011001111011 |
3 | 122110210202202112221200102001 |
4 | 132103010213131213121323 |
5 | 114431200120220332103 |
6 | 1151223044540521431 |
7 | 40032066223252606 |
oct | 3623044735473173 |
9 | 573722675850361 |
10 | 133252022433403 |
11 | 39504957877315 |
12 | 12b41174850277 |
13 | 59477c5174213 |
14 | 24c960a32133d |
15 | 10612ce44b01d |
hex | 79312776767b |
133252022433403 has 2 divisors, whose sum is σ = 133252022433404. Its totient is φ = 133252022433402.
The previous prime is 133252022433373. The next prime is 133252022433407. The reversal of 133252022433403 is 304334220252331.
It is a strong prime.
It is an emirp because it is prime and its reverse (304334220252331) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 133252022433403 - 25 = 133252022433371 is a prime.
It is a super-2 number, since 2×1332520224334032 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (133252022433407) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66626011216701 + 66626011216702.
It is an arithmetic number, because the mean of its divisors is an integer number (66626011216702).
Almost surely, 2133252022433403 is an apocalyptic number.
133252022433403 is a deficient number, since it is larger than the sum of its proper divisors (1).
133252022433403 is an equidigital number, since it uses as much as digits as its factorization.
133252022433403 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 311040, while the sum is 37.
Adding to 133252022433403 its reverse (304334220252331), we get a palindrome (437586242685734).
The spelling of 133252022433403 in words is "one hundred thirty-three trillion, two hundred fifty-two billion, twenty-two million, four hundred thirty-three thousand, four hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •