Base | Representation |
---|---|
bin | 111101111111010110… |
… | …1110001110000011111 |
3 | 110201121112100020010121 |
4 | 1323332231301300133 |
5 | 4140113320311111 |
6 | 141053335415411 |
7 | 12421620000511 |
oct | 1737655616037 |
9 | 421545306117 |
10 | 133122432031 |
11 | 51503162576 |
12 | 21972524567 |
13 | c726a54c54 |
14 | 662c061bb1 |
15 | 36e203d871 |
hex | 1efeb71c1f |
133122432031 has 8 divisors (see below), whose sum is σ = 138259756544. Its totient is φ = 128037798360.
The previous prime is 133122432019. The next prime is 133122432103. The reversal of 133122432031 is 130234221331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 133122432031 - 211 = 133122429983 is a prime.
It is a super-2 number, since 2×1331224320312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 133122431987 and 133122432005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133122432431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13167561 + ... + 13177666.
It is an arithmetic number, because the mean of its divisors is an integer number (17282469568).
Almost surely, 2133122432031 is an apocalyptic number.
133122432031 is a deficient number, since it is larger than the sum of its proper divisors (5137324513).
133122432031 is a wasteful number, since it uses less digits than its factorization.
133122432031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26345421.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 133122432031 its reverse (130234221331), we get a palindrome (263356653362).
The spelling of 133122432031 in words is "one hundred thirty-three billion, one hundred twenty-two million, four hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •