Base | Representation |
---|---|
bin | 1001001100110011101111… |
… | …01001000000001000010101 |
3 | 2122122002112022020120122010 |
4 | 10212121313221000020111 |
5 | 10122432202104420201 |
6 | 111010044332254433 |
7 | 4155443360550303 |
oct | 446316751001025 |
9 | 78562468216563 |
10 | 20231303201301 |
11 | 64a0058256735 |
12 | 2328b66611419 |
13 | b39a5a98411a |
14 | 4dd2b389d273 |
15 | 2513e1557bd6 |
hex | 126677a40215 |
20231303201301 has 8 divisors (see below), whose sum is σ = 26975092124320. Its totient is φ = 13487524872912.
The previous prime is 20231303201299. The next prime is 20231303201309. The reversal of 20231303201301 is 10310230313202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20231303201301 - 21 = 20231303201299 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 (20231303201309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4797570 + ... + 7967388.
It is an arithmetic number, because the mean of its divisors is an integer number (3371886515540).
Almost surely, 220231303201301 is an apocalyptic number.
It is an amenable number.
20231303201301 is a deficient number, since it is larger than the sum of its proper divisors (6743788923019).
20231303201301 is a wasteful number, since it uses less digits than its factorization.
20231303201301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5297315.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 20231303201301 its reverse (10310230313202), we get a palindrome (30541533514503).
The spelling of 20231303201301 in words is "twenty trillion, two hundred thirty-one billion, three hundred three million, two hundred one thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •