Base | Representation |
---|---|
bin | 1001001111000111001010… |
… | …11000000000111101011111 |
3 | 2122220122211102210010220220 |
4 | 10213203211120000331133 |
5 | 10130231302113401333 |
6 | 111110254341212423 |
7 | 4164244655362560 |
oct | 447434530007537 |
9 | 78818742703826 |
10 | 20310453653343 |
11 | 652068465a867 |
12 | 2340375a01113 |
13 | b44362aa8629 |
14 | 503061892167 |
15 | 2534c51638b3 |
hex | 1278e5600f5f |
20310453653343 has 8 divisors (see below), whose sum is σ = 30949262709888. Its totient is φ = 11605973516184.
The previous prime is 20310453653327. The next prime is 20310453653389. The reversal of 20310453653343 is 34335635401302.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20310453653343 - 24 = 20310453653327 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20310453653295 and 20310453653304.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20310453653543) 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, 483582229821 + ... + 483582229862.
It is an arithmetic number, because the mean of its divisors is an integer number (3868657838736).
Almost surely, 220310453653343 is an apocalyptic number.
20310453653343 is a deficient number, since it is larger than the sum of its proper divisors (10638809056545).
20310453653343 is an equidigital number, since it uses as much as digits as its factorization.
20310453653343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967164459693.
The product of its (nonzero) digits is 1166400, while the sum is 42.
The spelling of 20310453653343 in words is "twenty trillion, three hundred ten billion, four hundred fifty-three million, six hundred fifty-three thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •