Base | Representation |
---|---|
bin | 1001000110001011000011… |
… | …01010100000101011000101 |
3 | 2121211022000110022102122201 |
4 | 10203011201222200223011 |
5 | 10110213230103400201 |
6 | 110313220102554501 |
7 | 4133122311022633 |
oct | 443054152405305 |
9 | 77738013272581 |
10 | 20003301231301 |
11 | 6412397072a73 |
12 | 22b0935138a31 |
13 | b213c320763b |
14 | 4d2244878353 |
15 | 24a4e9acd801 |
hex | 123161aa0ac5 |
20003301231301 has 4 divisors (see below), whose sum is σ = 20873009980512. Its totient is φ = 19133592482092.
The previous prime is 20003301231257. The next prime is 20003301231337. The reversal of 20003301231301 is 10313210330002.
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 not a de Polignac number, because 20003301231301 - 213 = 20003301223109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20000301231301) 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, 434854374571 + ... + 434854374616.
It is an arithmetic number, because the mean of its divisors is an integer number (5218252495128).
Almost surely, 220003301231301 is an apocalyptic number.
It is an amenable number.
20003301231301 is a deficient number, since it is larger than the sum of its proper divisors (869708749211).
20003301231301 is an equidigital number, since it uses as much as digits as its factorization.
20003301231301 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 869708749210.
The product of its (nonzero) digits is 324, while the sum is 19.
Adding to 20003301231301 its reverse (10313210330002), we get a palindrome (30316511561303).
The spelling of 20003301231301 in words is "twenty trillion, three billion, three hundred one million, two hundred thirty-one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.034 sec. • engine limits •