Base | Representation |
---|---|
bin | 110001011101010011… |
… | …1000010110110111001 |
3 | 101011010221212200001102 |
4 | 1202322213002312321 |
5 | 3220004230400401 |
6 | 120443041101145 |
7 | 10446661132340 |
oct | 1427247026671 |
9 | 334127780042 |
10 | 106210012601 |
11 | 41052868520 |
12 | 187016277b5 |
13 | a02825a004 |
14 | 51d7adab57 |
15 | 2b6950856b |
hex | 18ba9c2db9 |
106210012601 has 16 divisors (see below), whose sum is σ = 132817763328. Its totient is φ = 82510995600.
The previous prime is 106210012507. The next prime is 106210012603.
106210012601 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 106210012601 - 230 = 105136270777 is a prime.
It is a super-2 number, since 2×1062100126012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (106210012603) 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, 2058125 + ... + 2109098.
It is an arithmetic number, because the mean of its divisors is an integer number (8301110208).
Almost surely, 2106210012601 is an apocalyptic number.
106210012601 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106210012601 is a deficient number, since it is larger than the sum of its proper divisors (26607750727).
106210012601 is a wasteful number, since it uses less digits than its factorization.
106210012601 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4167572.
The product of its (nonzero) digits is 144, while the sum is 20.
It can be divided in two parts, 1062100 and 12601, that added together give a palindrome (1074701).
The spelling of 106210012601 in words is "one hundred six billion, two hundred ten million, twelve thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •