Base | Representation |
---|---|
bin | 110001110001111001… |
… | …1111011111101110101 |
3 | 101012221010120120121121 |
4 | 1203203303323331311 |
5 | 3222413210224401 |
6 | 121035412543541 |
7 | 10503053462341 |
oct | 1434363737565 |
9 | 335833516547 |
10 | 106901258101 |
11 | 41377a784a0 |
12 | 18875021bb1 |
13 | a108522711 |
14 | 5261836621 |
15 | 2baa04bca1 |
hex | 18e3cfbf75 |
106901258101 has 16 divisors (see below), whose sum is σ = 123684905088. Its totient is φ = 91433707200.
The previous prime is 106901258099. The next prime is 106901258131. The reversal of 106901258101 is 101852109601.
It is not a de Polignac number, because 106901258101 - 21 = 106901258099 is a prime.
It is a super-2 number, since 2×1069012581012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106901258131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3447966 + ... + 3478831.
It is an arithmetic number, because the mean of its divisors is an integer number (7730306568).
Almost surely, 2106901258101 is an apocalyptic number.
106901258101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106901258101 is a deficient number, since it is larger than the sum of its proper divisors (16783646987).
106901258101 is a wasteful number, since it uses less digits than its factorization.
106901258101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6926892.
The product of its (nonzero) digits is 4320, while the sum is 34.
The spelling of 106901258101 in words is "one hundred six billion, nine hundred one million, two hundred fifty-eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •