Base | Representation |
---|---|
bin | 10110110110000110100001… |
… | …001011100110001111111111 |
3 | 111011202022012201202122220122 |
4 | 112312012201023212033333 |
5 | 101132140020234033414 |
6 | 553405304151205155 |
7 | 30110033021466614 |
oct | 2666064113461777 |
9 | 434668181678818 |
10 | 100474874127359 |
11 | 2a018178085676 |
12 | b3288540767bb |
13 | 440a980958554 |
14 | 1ab501d08450b |
15 | b938ae669b8e |
hex | 5b61a12e63ff |
100474874127359 has 4 divisors (see below), whose sum is σ = 105763025397240. Its totient is φ = 95186722857480.
The previous prime is 100474874127317. The next prime is 100474874127373. The reversal of 100474874127359 is 953721478474001.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100474874127359 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100474874127389) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2644075634912 + ... + 2644075634949.
It is an arithmetic number, because the mean of its divisors is an integer number (26440756349310).
Almost surely, 2100474874127359 is an apocalyptic number.
100474874127359 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
100474874127359 is a deficient number, since it is larger than the sum of its proper divisors (5288151269881).
100474874127359 is an equidigital number, since it uses as much as digits as its factorization.
100474874127359 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5288151269880.
The product of its (nonzero) digits is 47416320, while the sum is 62.
The spelling of 100474874127359 in words is "one hundred trillion, four hundred seventy-four billion, eight hundred seventy-four million, one hundred twenty-seven thousand, three hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •