Base | Representation |
---|---|
bin | 1001001001010011110100… |
… | …1111101010000100101001 |
3 | 1022121022010021202002221012 |
4 | 2102110331033222010221 |
5 | 2304222224231021401 |
6 | 33215242023353305 |
7 | 2055326542230020 |
oct | 222247517520451 |
9 | 38538107662835 |
10 | 10055545954601 |
11 | 32275955a8924 |
12 | 11649b9bb2835 |
13 | 57c306babb94 |
14 | 26a9962398b7 |
15 | 12687b6338bb |
hex | 9253d3ea129 |
10055545954601 has 8 divisors (see below), whose sum is σ = 11492081541504. Its totient is φ = 8619017623200.
The previous prime is 10055545954537. The next prime is 10055545954609. The reversal of 10055545954601 is 10645954555001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10055545954601 - 26 = 10055545954537 is a prime.
It is a super-2 number, since 2×100555459546012 (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 10055545954601.
It is not an unprimeable number, because it can be changed into a prime (10055545954609) 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, 1579076 + ... + 4754426.
It is an arithmetic number, because the mean of its divisors is an integer number (1436510192688).
Almost surely, 210055545954601 is an apocalyptic number.
It is an amenable number.
10055545954601 is a deficient number, since it is larger than the sum of its proper divisors (1436535586903).
10055545954601 is an equidigital number, since it uses as much as digits as its factorization.
10055545954601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3627751.
The product of its (nonzero) digits is 2700000, while the sum is 50.
The spelling of 10055545954601 in words is "ten trillion, fifty-five billion, five hundred forty-five million, nine hundred fifty-four thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •