Base | Representation |
---|---|
bin | 10110111100110010101101… |
… | …101110111110111111100001 |
3 | 111020101020222001002111122010 |
4 | 112330302231232332333201 |
5 | 101212203123413343014 |
6 | 554400423015103133 |
7 | 30155200425053523 |
oct | 2674625556767741 |
9 | 436336861074563 |
10 | 100934646231009 |
11 | 2a185163489138 |
12 | b3a1988971aa9 |
13 | 4442133750156 |
14 | 1acd397735a13 |
15 | ba081d79b359 |
hex | 5bccadbbefe1 |
100934646231009 has 8 divisors (see below), whose sum is σ = 134616984355872. Its totient is φ = 67271036130080.
The previous prime is 100934646230959. The next prime is 100934646231019. The reversal of 100934646231009 is 900132646439001.
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 100934646231009 - 228 = 100934377795553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (100934646231019) 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, 4681993407 + ... + 4682014964.
It is an arithmetic number, because the mean of its divisors is an integer number (16827123044484).
Almost surely, 2100934646231009 is an apocalyptic number.
It is an amenable number.
100934646231009 is a deficient number, since it is larger than the sum of its proper divisors (33682338124863).
100934646231009 is an equidigital number, since it uses as much as digits as its factorization.
100934646231009 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9364011967.
The product of its (nonzero) digits is 839808, while the sum is 48.
The spelling of 100934646231009 in words is "one hundred trillion, nine hundred thirty-four billion, six hundred forty-six million, two hundred thirty-one thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •