Base | Representation |
---|---|
bin | 110100110001011111111111… |
… | …111010011100100110100101 |
3 | 1010102210112202020120011020112 |
4 | 310301133333322130212211 |
5 | 220410211330443021013 |
6 | 2141345140553542405 |
7 | 66613450066610306 |
oct | 6461377772344645 |
9 | 1112715666504215 |
10 | 232100031220133 |
11 | 67a5508587444a |
12 | 2204665aa14a05 |
13 | 9c67c2908337b |
14 | 41459b6aca7ad |
15 | 1bc76c3b9aba8 |
hex | d317ffe9c9a5 |
232100031220133 has 16 divisors (see below), whose sum is σ = 246452349475584. Its totient is φ = 217825952954880.
The previous prime is 232100031220111. The next prime is 232100031220163. The reversal of 232100031220133 is 331022130001232.
It is a cyclic number.
It is not a de Polignac number, because 232100031220133 - 232 = 232095736252837 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 232100031220099 and 232100031220108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232100031220163) 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, 5667041 + ... + 22278137.
It is an arithmetic number, because the mean of its divisors is an integer number (15403271842224).
Almost surely, 2232100031220133 is an apocalyptic number.
It is an amenable number.
232100031220133 is a deficient number, since it is larger than the sum of its proper divisors (14352318255451).
232100031220133 is a wasteful number, since it uses less digits than its factorization.
232100031220133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16613452.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 232100031220133 its reverse (331022130001232), we get a palindrome (563122161221365).
The spelling of 232100031220133 in words is "two hundred thirty-two trillion, one hundred billion, thirty-one million, two hundred twenty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •