Base | Representation |
---|---|
bin | 10110111100100000001100… |
… | …011010100100000101100001 |
3 | 111020022100122010102001022201 |
4 | 112330200030122210011201 |
5 | 101211341412012030321 |
6 | 554343333425333201 |
7 | 30153564552615112 |
oct | 2674401432440541 |
9 | 436270563361281 |
10 | 100914759876961 |
11 | 2a177789120a98 |
12 | b399b58a97201 |
13 | 44402b4786254 |
14 | 1acc42c594209 |
15 | ba00579cd291 |
hex | 5bc80c6a4161 |
100914759876961 has 16 divisors (see below), whose sum is σ = 107813520691200. Its totient is φ = 94180208370768.
The previous prime is 100914759876947. The next prime is 100914759876979. The reversal of 100914759876961 is 169678957419001.
It is a cyclic number.
It is not a de Polignac number, because 100914759876961 - 215 = 100914759844193 is a prime.
It is a super-2 number, since 2×1009147598769612 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100914759876061) 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 15 ways as a sum of consecutive naturals, for example, 75217321 + ... + 76547206.
It is an arithmetic number, because the mean of its divisors is an integer number (6738345043200).
Almost surely, 2100914759876961 is an apocalyptic number.
It is an amenable number.
100914759876961 is a deficient number, since it is larger than the sum of its proper divisors (6898760814239).
100914759876961 is a wasteful number, since it uses less digits than its factorization.
100914759876961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151765068.
The product of its (nonzero) digits is 205752960, while the sum is 73.
The spelling of 100914759876961 in words is "one hundred trillion, nine hundred fourteen billion, seven hundred fifty-nine million, eight hundred seventy-six thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •