Base | Representation |
---|---|
bin | 1001101010011011000011… |
… | …0110010111000110100111 |
3 | 1101121200111011210221122002 |
4 | 2122212300312113012213 |
5 | 2343032303304212211 |
6 | 34332443001355515 |
7 | 2144406026560445 |
oct | 232466066270647 |
9 | 41550434727562 |
10 | 10624421163431 |
11 | 3426878850109 |
12 | 1237101198b9b |
13 | 5c0b5642349a |
14 | 28a320921b95 |
15 | 136573c4603b |
hex | 9a9b0d971a7 |
10624421163431 has 16 divisors (see below), whose sum is σ = 10801883433600. Its totient is φ = 10448420785248.
The previous prime is 10624421163403. The next prime is 10624421163443. The reversal of 10624421163431 is 13436112442601.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10624421163431 is a prime.
It is a super-3 number, since 3×106244211634313 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10624421163491) 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 15 ways as a sum of consecutive naturals, for example, 195746165 + ... + 195800433.
It is an arithmetic number, because the mean of its divisors is an integer number (675117714600).
Almost surely, 210624421163431 is an apocalyptic number.
10624421163431 is a deficient number, since it is larger than the sum of its proper divisors (177462270169).
10624421163431 is a wasteful number, since it uses less digits than its factorization.
10624421163431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 67678.
The product of its (nonzero) digits is 82944, while the sum is 38.
The spelling of 10624421163431 in words is "ten trillion, six hundred twenty-four billion, four hundred twenty-one million, one hundred sixty-three thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •