Base | Representation |
---|---|
bin | 1001001001100100101000… |
… | …01100111011010010011001 |
3 | 2122020110112021200211212222 |
4 | 10210302110030323102121 |
5 | 10114121442441343001 |
6 | 110443015153313425 |
7 | 4144426106443550 |
oct | 444622414732231 |
9 | 78213467624788 |
10 | 20120113231001 |
11 | 645798a4302a3 |
12 | 230b4b5265875 |
13 | b2c41aa94ca4 |
14 | 4d7b6663ad97 |
15 | 24d584c5661b |
hex | 124c9433b499 |
20120113231001 has 4 divisors (see below), whose sum is σ = 22994415121152. Its totient is φ = 17245811340852.
The previous prime is 20120113230961. The next prime is 20120113231151. The reversal of 20120113231001 is 10013231102102.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20120113231001 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (20120113231201) 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, 1437150945065 + ... + 1437150945078.
It is an arithmetic number, because the mean of its divisors is an integer number (5748603780288).
Almost surely, 220120113231001 is an apocalyptic number.
It is an amenable number.
20120113231001 is a deficient number, since it is larger than the sum of its proper divisors (2874301890151).
20120113231001 is an equidigital number, since it uses as much as digits as its factorization.
20120113231001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2874301890150.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 20120113231001 its reverse (10013231102102), we get a palindrome (30133344333103).
The spelling of 20120113231001 in words is "twenty trillion, one hundred twenty billion, one hundred thirteen million, two hundred thirty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •