Base | Representation |
---|---|
bin | 11101100100101110100… |
… | …001010010111011011111 |
3 | 21012021201111000102121100 |
4 | 131210232201102323133 |
5 | 231244122300324411 |
6 | 4153343054204143 |
7 | 266554201033020 |
oct | 35445641227337 |
9 | 7167644012540 |
10 | 2032300011231 |
11 | 713991413346 |
12 | 289a591b3653 |
13 | 1198502a6759 |
14 | 7051456ac47 |
15 | 37ce89cb456 |
hex | 1d92e852edf |
2032300011231 has 12 divisors (see below), whose sum is σ = 3354907955152. Its totient is φ = 1161314292096.
The previous prime is 2032300011227. The next prime is 2032300011233. The reversal of 2032300011231 is 1321100032302.
2032300011231 is a `hidden beast` number, since 203 + 230 + 0 + 0 + 1 + 1 + 231 = 666.
It is not a de Polignac number, because 2032300011231 - 22 = 2032300011227 is a prime.
It is a super-2 number, since 2×20323000112312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2032300011233) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 16129365106 + ... + 16129365231.
Almost surely, 22032300011231 is an apocalyptic number.
2032300011231 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2032300011231 is a deficient number, since it is larger than the sum of its proper divisors (1322607943921).
2032300011231 is a wasteful number, since it uses less digits than its factorization.
2032300011231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32258730350 (or 32258730347 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2032300011231 its reverse (1321100032302), we get a palindrome (3353400043533).
The spelling of 2032300011231 in words is "two trillion, thirty-two billion, three hundred million, eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •