Base | Representation |
---|---|
bin | 1001001001010101100110… |
… | …00111110000010000110111 |
3 | 2122012200200210022120101021 |
4 | 10210222303013300100313 |
5 | 10114003430230043411 |
6 | 110435202231442011 |
7 | 4144022102423620 |
oct | 444526307602067 |
9 | 78180623276337 |
10 | 20112042034231 |
11 | 6454518454744 |
12 | 2309a22226307 |
13 | b2b732884704 |
14 | 4d75dc71ca47 |
15 | 24d261395a71 |
hex | 124ab31f0437 |
20112042034231 has 16 divisors (see below), whose sum is σ = 23561944116480. Its totient is φ = 16806904643520.
The previous prime is 20112042034169. The next prime is 20112042034241. The reversal of 20112042034231 is 13243024021102.
It is a cyclic number.
It is not a de Polignac number, because 20112042034231 - 27 = 20112042034103 is a prime.
It is a super-2 number, since 2×201120420342312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20112042034196 and 20112042034205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20112042034241) 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, 23596621 + ... + 24434086.
It is an arithmetic number, because the mean of its divisors is an integer number (1472621507280).
Almost surely, 220112042034231 is an apocalyptic number.
20112042034231 is a deficient number, since it is larger than the sum of its proper divisors (3449902082249).
20112042034231 is a wasteful number, since it uses less digits than its factorization.
20112042034231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48032214.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 20112042034231 its reverse (13243024021102), we get a palindrome (33355066055333).
The spelling of 20112042034231 in words is "twenty trillion, one hundred twelve billion, forty-two million, thirty-four thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •