Base | Representation |
---|---|
bin | 1001010100101000001000… |
… | …0010010111100111100011 |
3 | 1100021212222021201020111022 |
4 | 2111022002002113213203 |
5 | 2320413421222033423 |
6 | 33444434535240055 |
7 | 2105351621204021 |
oct | 225120202274743 |
9 | 40255867636438 |
10 | 10249973627363 |
11 | 32a1a979950a8 |
12 | 119661b51902b |
13 | 5947509124b2 |
14 | 27615c237711 |
15 | 12b95a79cdc8 |
hex | 952820979e3 |
10249973627363 has 64 divisors (see below), whose sum is σ = 11647649664000. Its totient is φ = 8962269732864.
The previous prime is 10249973627323. The next prime is 10249973627459. The reversal of 10249973627363 is 36372637994201.
It is a Cunningham number, because it is equal to 32015582-1.
It is not a de Polignac number, because 10249973627363 - 228 = 10249705191907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10249973627296 and 10249973627305.
It is not an unprimeable number, because it can be changed into a prime (10249973627303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4517395793 + ... + 4517398061.
It is an arithmetic number, because the mean of its divisors is an integer number (181994526000).
Almost surely, 210249973627363 is an apocalyptic number.
10249973627363 is a deficient number, since it is larger than the sum of its proper divisors (1397676036637).
10249973627363 is a wasteful number, since it uses less digits than its factorization.
10249973627363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3564.
The product of its (nonzero) digits is 61725888, while the sum is 62.
The spelling of 10249973627363 in words is "ten trillion, two hundred forty-nine billion, nine hundred seventy-three million, six hundred twenty-seven thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •