Base | Representation |
---|---|
bin | 111110000010100100… |
… | …0001100011010000111 |
3 | 110201220000210021101202 |
4 | 1330011020030122013 |
5 | 4140323341121411 |
6 | 141112141413115 |
7 | 12424364325650 |
oct | 1740510143207 |
9 | 421800707352 |
10 | 133230020231 |
11 | 51558967140 |
12 | 219a256a19b |
13 | c7431245c9 |
14 | 663c46a527 |
15 | 36eb6e183b |
hex | 1f0520c687 |
133230020231 has 16 divisors (see below), whose sum is σ = 167032938240. Its totient is φ = 103235614080.
The previous prime is 133230020171. The next prime is 133230020263. The reversal of 133230020231 is 132020032331.
It is a cyclic number.
It is not a de Polignac number, because 133230020231 - 210 = 133230019207 is a prime.
It is a super-2 number, since 2×1332300202312 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133230020281) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4819346 + ... + 4846911.
It is an arithmetic number, because the mean of its divisors is an integer number (10439558640).
Almost surely, 2133230020231 is an apocalyptic number.
133230020231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133230020231 is a deficient number, since it is larger than the sum of its proper divisors (33802918009).
133230020231 is a wasteful number, since it uses less digits than its factorization.
133230020231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9666454.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 133230020231 its reverse (132020032331), we get a palindrome (265250052562).
It can be divided in two parts, 1332300 and 20231, that added together give a palindrome (1352531).
The spelling of 133230020231 in words is "one hundred thirty-three billion, two hundred thirty million, twenty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •