Base | Representation |
---|---|
bin | 1001001001111001010101… |
… | …10100000111110111011011 |
3 | 2122021112020000220101210211 |
4 | 10210330222310013313123 |
5 | 10114312224341220011 |
6 | 110452054232551551 |
7 | 4145301434560333 |
oct | 444745264076733 |
9 | 78245200811724 |
10 | 20131230023131 |
11 | 6461674589807 |
12 | 23116982525b7 |
13 | b3049cc623b6 |
14 | 4d84dcc300c3 |
15 | 24d9d5bb5b21 |
hex | 124f2ad07ddb |
20131230023131 has 4 divisors (see below), whose sum is σ = 20179047672064. Its totient is φ = 20083412374200.
The previous prime is 20131230023123. The next prime is 20131230023141. The reversal of 20131230023131 is 13132003213102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20131230023131 - 23 = 20131230023123 is a prime.
It is a super-2 number, since 2×201312300231312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20131230023141) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 23908823835 + ... + 23908824676.
It is an arithmetic number, because the mean of its divisors is an integer number (5044761918016).
Almost surely, 220131230023131 is an apocalyptic number.
20131230023131 is a deficient number, since it is larger than the sum of its proper divisors (47817648933).
20131230023131 is an equidigital number, since it uses as much as digits as its factorization.
20131230023131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47817648932.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20131230023131 its reverse (13132003213102), we get a palindrome (33263233236233).
The spelling of 20131230023131 in words is "twenty trillion, one hundred thirty-one billion, two hundred thirty million, twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •