Base | Representation |
---|---|
bin | 1001001001010100010000… |
… | …0010111001100011010011 |
3 | 1022121022102020102210021112 |
4 | 2102111010002321203103 |
5 | 2304222442433110033 |
6 | 33215301221043535 |
7 | 2055332426101364 |
oct | 222250402714323 |
9 | 38538366383245 |
10 | 10055660050643 |
11 | 3227643a47979 |
12 | 1164a302565ab |
13 | 57c32471972c |
14 | 26a9a7459b6b |
15 | 12688666ec48 |
hex | 925440b98d3 |
10055660050643 has 8 divisors (see below), whose sum is σ = 10075838001408. Its totient is φ = 10035488650824.
The previous prime is 10055660050603. The next prime is 10055660050649. The reversal of 10055660050643 is 34605006655001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10055660050643 is a prime.
It is a super-2 number, since 2×100556600506432 (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 10055660050643.
It is not an unprimeable number, because it can be changed into a prime (10055660050649) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1441130 + ... + 4710432.
It is an arithmetic number, because the mean of its divisors is an integer number (1259479750176).
Almost surely, 210055660050643 is an apocalyptic number.
10055660050643 is a deficient number, since it is larger than the sum of its proper divisors (20177950765).
10055660050643 is an equidigital number, since it uses as much as digits as its factorization.
10055660050643 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3275473.
The product of its (nonzero) digits is 324000, while the sum is 41.
The spelling of 10055660050643 in words is "ten trillion, fifty-five billion, six hundred sixty million, fifty thousand, six hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •