Base | Representation |
---|---|
bin | 1001010010000101111001… |
… | …1001011000001110110101 |
3 | 1100010201120101011212222210 |
4 | 2110201132121120032311 |
5 | 2314210230024201303 |
6 | 33412433430444033 |
7 | 2102250515425065 |
oct | 224413631301665 |
9 | 40121511155883 |
10 | 10206426006453 |
11 | 3285580443a56 |
12 | 118a0a7503619 |
13 | 59060088c081 |
14 | 273dca8333a5 |
15 | 12a75c5ee203 |
hex | 9485e6583b5 |
10206426006453 has 8 divisors (see below), whose sum is σ = 13608594165600. Its totient is φ = 6804270925808.
The previous prime is 10206426006449. The next prime is 10206426006487. The reversal of 10206426006453 is 35460062460201.
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 10206426006453 - 22 = 10206426006449 is a prime.
It is a super-2 number, since 2×102064260064532 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206426006053) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1274838 + ... + 4694471.
It is an arithmetic number, because the mean of its divisors is an integer number (1701074270700).
Almost surely, 210206426006453 is an apocalyptic number.
It is an amenable number.
10206426006453 is a deficient number, since it is larger than the sum of its proper divisors (3402168159147).
10206426006453 is an equidigital number, since it uses as much as digits as its factorization.
10206426006453 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6539251.
The product of its (nonzero) digits is 207360, while the sum is 39.
Adding to 10206426006453 its reverse (35460062460201), we get a palindrome (45666488466654).
The spelling of 10206426006453 in words is "ten trillion, two hundred six billion, four hundred twenty-six million, six thousand, four hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •