Base | Representation |
---|---|
bin | 1101100000101101101… |
… | …1100110110000111111 |
3 | 211012010211202202121221 |
4 | 3120023123212300333 |
5 | 12300340211120111 |
6 | 254345013334211 |
7 | 22525102421164 |
oct | 3301333466077 |
9 | 735124682557 |
10 | 232120020031 |
11 | 8a4947776a9 |
12 | 38ba0637367 |
13 | 18b729916a3 |
14 | b33dd0806b |
15 | 608826c371 |
hex | 360b6e6c3f |
232120020031 has 4 divisors (see below), whose sum is σ = 232388989632. Its totient is φ = 231851050432.
The previous prime is 232120019977. The next prime is 232120020061. The reversal of 232120020031 is 130020021232.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 232120020031 - 215 = 232119987263 is a prime.
It is a super-2 number, since 2×2321200200312 (a number of 24 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 = 232120019987 and 232120020014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232120020061) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 134483506 + ... + 134485231.
It is an arithmetic number, because the mean of its divisors is an integer number (58097247408).
Almost surely, 2232120020031 is an apocalyptic number.
232120020031 is a deficient number, since it is larger than the sum of its proper divisors (268969601).
232120020031 is an equidigital number, since it uses as much as digits as its factorization.
232120020031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 268969600.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 232120020031 its reverse (130020021232), we get a palindrome (362140041263).
The spelling of 232120020031 in words is "two hundred thirty-two billion, one hundred twenty million, twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •