Base | Representation |
---|---|
bin | 1001001001111001011111… |
… | …01101101011011111011011 |
3 | 2122021112102202120102212212 |
4 | 10210330233231223133123 |
5 | 10114312411412020443 |
6 | 110452110330425335 |
7 | 4145303453333606 |
oct | 444745755533733 |
9 | 78245382512785 |
10 | 20131312220123 |
11 | 6461706a20605 |
12 | 23116bb89224b |
13 | b304b3cb1780 |
14 | 4d8509b0933d |
15 | 24d9dd000618 |
hex | 124f2fb6b7db |
20131312220123 has 32 divisors (see below), whose sum is σ = 22380526264320. Its totient is φ = 17991811918080.
The previous prime is 20131312220101. The next prime is 20131312220137. The reversal of 20131312220123 is 32102221313102.
It is a de Polignac number, because none of the positive numbers 2k-20131312220123 is a prime.
It is a super-2 number, since 2×201313122201232 (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 (20131312220923) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 303007718 + ... + 303074148.
It is an arithmetic number, because the mean of its divisors is an integer number (699391445760).
Almost surely, 220131312220123 is an apocalyptic number.
20131312220123 is a deficient number, since it is larger than the sum of its proper divisors (2249214044197).
20131312220123 is a wasteful number, since it uses less digits than its factorization.
20131312220123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72467.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 20131312220123 its reverse (32102221313102), we get a palindrome (52233533533225).
The spelling of 20131312220123 in words is "twenty trillion, one hundred thirty-one billion, three hundred twelve million, two hundred twenty thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •