Base | Representation |
---|---|
bin | 101111000100111010… |
… | …0010001110110111011 |
3 | 100122221120202210212120 |
4 | 1132021310101312323 |
5 | 3124021141243120 |
6 | 114235411212323 |
7 | 10206156325305 |
oct | 1361164216673 |
9 | 318846683776 |
10 | 101096431035 |
11 | 39969332a56 |
12 | 17714ba70a3 |
13 | 96c1a10ac2 |
14 | 4c70910975 |
15 | 296a618140 |
hex | 1789d11dbb |
101096431035 has 32 divisors (see below), whose sum is σ = 162520888320. Its totient is φ = 53663174400.
The previous prime is 101096431027. The next prime is 101096431087. The reversal of 101096431035 is 530134690101.
It is not a de Polignac number, because 101096431035 - 23 = 101096431027 is a prime.
It is a super-2 number, since 2×1010964310352 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101096430987 and 101096431005.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2690175 + ... + 2727495.
It is an arithmetic number, because the mean of its divisors is an integer number (5078777760).
Almost surely, 2101096431035 is an apocalyptic number.
101096431035 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
101096431035 is a deficient number, since it is larger than the sum of its proper divisors (61424457285).
101096431035 is a wasteful number, since it uses less digits than its factorization.
101096431035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38179.
The product of its (nonzero) digits is 9720, while the sum is 33.
The spelling of 101096431035 in words is "one hundred one billion, ninety-six million, four hundred thirty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •