Base | Representation |
---|---|
bin | 10110110101011110010011… |
… | …000111011011100111111111 |
3 | 111011121011202001100112112022 |
4 | 112311132103013123213333 |
5 | 101130433044222400104 |
6 | 553333403013030355 |
7 | 30103643602531121 |
oct | 2665362307334777 |
9 | 434534661315468 |
10 | 100431688481279 |
11 | 2a000926998581 |
12 | b3204013253bb |
13 | 440688a8c1a0c |
14 | 1ab2cc3787211 |
15 | b926d316cbbe |
hex | 5b57931db9ff |
100431688481279 has 8 divisors (see below), whose sum is σ = 100629392087520. Its totient is φ = 100234166507776.
The previous prime is 100431688481269. The next prime is 100431688481353. The reversal of 100431688481279 is 972184886134001.
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-100431688481279 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 (100431688481269) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 44301194 + ... + 46512999.
It is an arithmetic number, because the mean of its divisors is an integer number (12578674010940).
Almost surely, 2100431688481279 is an apocalyptic number.
100431688481279 is a deficient number, since it is larger than the sum of its proper divisors (197703606241).
100431688481279 is an equidigital number, since it uses as much as digits as its factorization.
100431688481279 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 90816369.
The product of its (nonzero) digits is 18579456, while the sum is 62.
The spelling of 100431688481279 in words is "one hundred trillion, four hundred thirty-one billion, six hundred eighty-eight million, four hundred eighty-one thousand, two hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •