Base | Representation |
---|---|
bin | 1001101011011110110110… |
… | …1010110000010111010011 |
3 | 1101200102110120202210022122 |
4 | 2122313231222300113103 |
5 | 2343332042034304111 |
6 | 34345052555524455 |
7 | 2145622036205261 |
oct | 232675552602723 |
9 | 41612416683278 |
10 | 10642621400531 |
11 | 343356836767a |
12 | 123a74045972b |
13 | 5c2796c91c53 |
14 | 28b169b93431 |
15 | 136c8b9a3cdb |
hex | 9adedab05d3 |
10642621400531 has 16 divisors (see below), whose sum is σ = 11353355942400. Its totient is φ = 9947144282400.
The previous prime is 10642621400527. The next prime is 10642621400597. The reversal of 10642621400531 is 13500412624601.
It is not a de Polignac number, because 10642621400531 - 22 = 10642621400527 is a prime.
It is a super-2 number, since 2×106426214005312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10642621400491 and 10642621400500.
It is not an unprimeable number, because it can be changed into a prime (10642621600531) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 808280 + ... + 4683861.
It is an arithmetic number, because the mean of its divisors is an integer number (709584746400).
Almost surely, 210642621400531 is an apocalyptic number.
10642621400531 is a deficient number, since it is larger than the sum of its proper divisors (710734541869).
10642621400531 is a wasteful number, since it uses less digits than its factorization.
10642621400531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5493530.
The product of its (nonzero) digits is 34560, while the sum is 35.
The spelling of 10642621400531 in words is "ten trillion, six hundred forty-two billion, six hundred twenty-one million, four hundred thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •