Base | Representation |
---|---|
bin | 1001001001010100010000… |
… | …0010111001100011010001 |
3 | 1022121022102020102210021110 |
4 | 2102111010002321203101 |
5 | 2304222442433110031 |
6 | 33215301221043533 |
7 | 2055332426101362 |
oct | 222250402714321 |
9 | 38538366383243 |
10 | 10055660050641 |
11 | 3227643a47977 |
12 | 1164a302565a9 |
13 | 57c32471972a |
14 | 26a9a7459b69 |
15 | 12688666ec46 |
hex | 925440b98d1 |
10055660050641 has 16 divisors (see below), whose sum is σ = 13652158962176. Its totient is φ = 6582290864256.
The previous prime is 10055660050603. The next prime is 10055660050649. The reversal of 10055660050641 is 14605006655001.
It is not a de Polignac number, because 10055660050641 - 29 = 10055660050129 is a prime.
It is a super-2 number, since 2×100556600506412 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 10055660050641.
It is not an unprimeable number, because it can be changed into a prime (10055660050649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 102902410 + ... + 103000083.
It is an arithmetic number, because the mean of its divisors is an integer number (853259935136).
Almost surely, 210055660050641 is an apocalyptic number.
It is an amenable number.
10055660050641 is a deficient number, since it is larger than the sum of its proper divisors (3596498911535).
10055660050641 is a wasteful number, since it uses less digits than its factorization.
10055660050641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 205902792.
The product of its (nonzero) digits is 108000, while the sum is 39.
The spelling of 10055660050641 in words is "ten trillion, fifty-five billion, six hundred sixty million, fifty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •