Base | Representation |
---|---|
bin | 1001001001101100010001… |
… | …00000111010001110010111 |
3 | 2122020212002221110111010211 |
4 | 10210312020200322032113 |
5 | 10114203341300011411 |
6 | 110444534014430251 |
7 | 4144632510364015 |
oct | 444661040721627 |
9 | 78225087414124 |
10 | 20124212110231 |
11 | 64596a310a999 |
12 | 2310259b02387 |
13 | b2c922027008 |
14 | 4d8034b6d8b5 |
15 | 24d724a0e221 |
hex | 124d8883a397 |
20124212110231 has 8 divisors (see below), whose sum is σ = 20145150883584. Its totient is φ = 20103282034680.
The previous prime is 20124212110199. The next prime is 20124212110283. The reversal of 20124212110231 is 13201121242102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20124212110231 - 25 = 20124212110199 is a prime.
It is a super-2 number, since 2×201242121102312 (a number of 27 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 (20124212117231) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2460516 + ... + 6804598.
It is an arithmetic number, because the mean of its divisors is an integer number (2518143860448).
Almost surely, 220124212110231 is an apocalyptic number.
20124212110231 is a deficient number, since it is larger than the sum of its proper divisors (20938773353).
20124212110231 is a wasteful number, since it uses less digits than its factorization.
20124212110231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4348901.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 20124212110231 its reverse (13201121242102), we get a palindrome (33325333352333).
The spelling of 20124212110231 in words is "twenty trillion, one hundred twenty-four billion, two hundred twelve million, one hundred ten thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •