Base | Representation |
---|---|
bin | 110100110001101010010100… |
… | …011001011010011001000101 |
3 | 1010102211121100111120100021201 |
4 | 310301222110121122121011 |
5 | 220410402024222100401 |
6 | 2141354212315542501 |
7 | 66614321512335016 |
oct | 6461522431323105 |
9 | 1112747314510251 |
10 | 232111112300101 |
11 | 67a59851850881 |
12 | 22048831a5aa31 |
13 | 9c68ca3a28818 |
14 | 414634866500d |
15 | 1bc7b21903b01 |
hex | d31a9465a645 |
232111112300101 has 32 divisors (see below), whose sum is σ = 239763631288320. Its totient is φ = 224592152241600.
The previous prime is 232111112300071. The next prime is 232111112300117. The reversal of 232111112300101 is 101003211111232.
It is a cyclic number.
It is not a de Polignac number, because 232111112300101 - 229 = 232110575429189 is a prime.
It is a super-2 number, since 2×2321111123001012 (a number of 30 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 (232111112300131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 14758758100 + ... + 14758773826.
It is an arithmetic number, because the mean of its divisors is an integer number (7492613477760).
Almost surely, 2232111112300101 is an apocalyptic number.
It is an amenable number.
232111112300101 is a deficient number, since it is larger than the sum of its proper divisors (7652518988219).
232111112300101 is a wasteful number, since it uses less digits than its factorization.
232111112300101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 20545.
The product of its (nonzero) digits is 72, while the sum is 19.
Adding to 232111112300101 its reverse (101003211111232), we get a palindrome (333114323411333).
The spelling of 232111112300101 in words is "two hundred thirty-two trillion, one hundred eleven billion, one hundred twelve million, three hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •