Base | Representation |
---|---|
bin | 1001010001101111111010… |
… | …11001101010110100011111 |
3 | 2200020022200022202220210011 |
4 | 10220313331121222310133 |
5 | 10133222323032201333 |
6 | 111220040302024051 |
7 | 4203633030516232 |
oct | 450677531526437 |
9 | 80208608686704 |
10 | 20401051053343 |
11 | 6556045513364 |
12 | 2355a3a878027 |
13 | b4ca705c5c1c |
14 | 5075b7c5b419 |
15 | 255a28b979cd |
hex | 128dfd66ad1f |
20401051053343 has 4 divisors (see below), whose sum is σ = 20430153837288. Its totient is φ = 20371948269400.
The previous prime is 20401051053283. The next prime is 20401051053359. The reversal of 20401051053343 is 34335015010402.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20401051053343 - 217 = 20401050922271 is a prime.
It is a super-2 number, since 2×204010510533432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20401051023343) 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, 14551390921 + ... + 14551392322.
It is an arithmetic number, because the mean of its divisors is an integer number (5107538459322).
Almost surely, 220401051053343 is an apocalyptic number.
20401051053343 is a deficient number, since it is larger than the sum of its proper divisors (29102783945).
20401051053343 is an equidigital number, since it uses as much as digits as its factorization.
20401051053343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29102783944.
The product of its (nonzero) digits is 21600, while the sum is 31.
Adding to 20401051053343 its reverse (34335015010402), we get a palindrome (54736066063745).
The spelling of 20401051053343 in words is "twenty trillion, four hundred one billion, fifty-one million, fifty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •