Base | Representation |
---|---|
bin | 1001000110001010101101… |
… | …11100001010111001000101 |
3 | 2121211021112220202112211000 |
4 | 10203011112330022321011 |
5 | 10110212343023430201 |
6 | 110313150154403513 |
7 | 4133114664516552 |
oct | 443052674127105 |
9 | 77737486675730 |
10 | 20003121311301 |
11 | 6412304555457 |
12 | 22b08a4a30599 |
13 | b21394b60cbb |
14 | 4d2228a01a29 |
15 | 24a4d8dddd86 |
hex | 123156f0ae45 |
20003121311301 has 8 divisors (see below), whose sum is σ = 29634253794560. Its totient is φ = 13335414207516.
The previous prime is 20003121311279. The next prime is 20003121311309. The reversal of 20003121311301 is 10311312130002.
20003121311301 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 31 + 21 + 311 + 301 = 666.
It is not a de Polignac number, because 20003121311301 - 29 = 20003121310789 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20003121311309) 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, 370428172405 + ... + 370428172458.
It is an arithmetic number, because the mean of its divisors is an integer number (3704281724320).
Almost surely, 220003121311301 is an apocalyptic number.
It is an amenable number.
20003121311301 is a deficient number, since it is larger than the sum of its proper divisors (9631132483259).
20003121311301 is an equidigital number, since it uses as much as digits as its factorization.
20003121311301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 740856344872 (or 740856344866 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 20003121311301 its reverse (10311312130002), we get a palindrome (30314433441303).
The spelling of 20003121311301 in words is "twenty trillion, three billion, one hundred twenty-one million, three hundred eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •