Base | Representation |
---|---|
bin | 101111010110101110… |
… | …0110101100011000000 |
3 | 100201111020200221122010 |
4 | 1132231130311203000 |
5 | 3131232212444121 |
6 | 114415005012520 |
7 | 10230035665113 |
oct | 1365534654300 |
9 | 321436627563 |
10 | 101694265536 |
11 | 3a145841956 |
12 | 17861254140 |
13 | 978882bb26 |
14 | 4cca09257a |
15 | 29a2d59376 |
hex | 17ad7358c0 |
101694265536 has 112 divisors (see below), whose sum is σ = 272974003200. Its totient is φ = 33407342592.
The previous prime is 101694265513. The next prime is 101694265567. The reversal of 101694265536 is 635562496101.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is an unprimeable number.
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, 8624701 + ... + 8636483.
Almost surely, 2101694265536 is an apocalyptic number.
101694265536 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 101694265536, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (136487001600).
101694265536 is an abundant number, since it is smaller than the sum of its proper divisors (171279737664).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101694265536 is a wasteful number, since it uses less digits than its factorization.
101694265536 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12446 (or 12436 counting only the distinct ones).
The product of its (nonzero) digits is 1166400, while the sum is 48.
The spelling of 101694265536 in words is "one hundred one billion, six hundred ninety-four million, two hundred sixty-five thousand, five hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •