Base | Representation |
---|---|
bin | 1001010010100110000001… |
… | …11011111111101000110001 |
3 | 2200100002122220011001200112 |
4 | 10221103000323333220301 |
5 | 10134211321430144101 |
6 | 111241243052031105 |
7 | 4206011646505502 |
oct | 451230073775061 |
9 | 80302586131615 |
10 | 20430101412401 |
11 | 65673a26aa06a |
12 | 235b5a7762495 |
13 | b527200037b5 |
14 | 508b72106ba9 |
15 | 25667923b6bb |
hex | 1294c0effa31 |
20430101412401 has 8 divisors (see below), whose sum is σ = 20472005283840. Its totient is φ = 20388230579248.
The previous prime is 20430101412397. The next prime is 20430101412403. The reversal of 20430101412401 is 10421410103402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20430101412401 - 22 = 20430101412397 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20430101412403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7021361 + ... + 9495246.
It is an arithmetic number, because the mean of its divisors is an integer number (2559000660480).
Almost surely, 220430101412401 is an apocalyptic number.
It is an amenable number.
20430101412401 is a deficient number, since it is larger than the sum of its proper divisors (41903871439).
20430101412401 is a wasteful number, since it uses less digits than its factorization.
20430101412401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16519143.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 20430101412401 its reverse (10421410103402), we get a palindrome (30851511515803).
The spelling of 20430101412401 in words is "twenty trillion, four hundred thirty billion, one hundred one million, four hundred twelve thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •