Base | Representation |
---|---|
bin | 10110110000001000011000… |
… | …110001011000100101100101 |
3 | 111010022002010111020100020020 |
4 | 112300020120301120211211 |
5 | 101103424211244124112 |
6 | 552453005334025353 |
7 | 30035266112203434 |
oct | 2660103061304545 |
9 | 433262114210206 |
10 | 100064563661157 |
11 | 2997a163566427 |
12 | b281223aa8259 |
13 | 43ab081209144 |
14 | 1a9d21782311b |
15 | b87d979d848c |
hex | 5b0218c58965 |
100064563661157 has 24 divisors (see below), whose sum is σ = 141039579744000. Its totient is φ = 63092328602688.
The previous prime is 100064563661147. The next prime is 100064563661197. The reversal of 100064563661157 is 751166365460001.
It is not a de Polignac number, because 100064563661157 - 24 = 100064563661141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100064563661147) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 354087157 + ... + 354369642.
It is an arithmetic number, because the mean of its divisors is an integer number (5876649156000).
Almost surely, 2100064563661157 is an apocalyptic number.
It is an amenable number.
100064563661157 is a deficient number, since it is larger than the sum of its proper divisors (40975016082843).
100064563661157 is an equidigital number, since it uses as much as digits as its factorization.
100064563661157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 708456937 (or 708456914 counting only the distinct ones).
The product of its (nonzero) digits is 2721600, while the sum is 51.
The spelling of 100064563661157 in words is "one hundred trillion, sixty-four billion, five hundred sixty-three million, six hundred sixty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •