Base | Representation |
---|---|
bin | 1001010010000101100000… |
… | …1101100010111110010111 |
3 | 1100010201022010221002010211 |
4 | 2110201120031202332113 |
5 | 2314210021443211211 |
6 | 33412415242430251 |
7 | 2102245115432131 |
oct | 224413015427627 |
9 | 40121263832124 |
10 | 10206322241431 |
11 | 3285527910838 |
12 | 118a078802387 |
13 | 5905b522a954 |
14 | 273dbab42051 |
15 | 12a753453e21 |
hex | 94858362f97 |
10206322241431 has 4 divisors (see below), whose sum is σ = 10208946653200. Its totient is φ = 10203697829664.
The previous prime is 10206322241429. The next prime is 10206322241501. The reversal of 10206322241431 is 13414222360201.
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 10206322241431 - 21 = 10206322241429 is a prime.
It is a super-2 number, since 2×102063222414312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10206322241393 and 10206322241402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10206322241411) 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, 1312200051 + ... + 1312207828.
It is an arithmetic number, because the mean of its divisors is an integer number (2552236663300).
Almost surely, 210206322241431 is an apocalyptic number.
10206322241431 is a deficient number, since it is larger than the sum of its proper divisors (2624411769).
10206322241431 is an equidigital number, since it uses as much as digits as its factorization.
10206322241431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2624411768.
The product of its (nonzero) digits is 13824, while the sum is 31.
The spelling of 10206322241431 in words is "ten trillion, two hundred six billion, three hundred twenty-two million, two hundred forty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •