Base | Representation |
---|---|
bin | 110001100100100011… |
… | …0000001000000010101 |
3 | 101011202220010100020201 |
4 | 1203021012001000111 |
5 | 3221003432400001 |
6 | 120523121300501 |
7 | 10456001451013 |
oct | 1431106010025 |
9 | 334686110221 |
10 | 106453012501 |
11 | 41167a4a990 |
12 | 1876aa94731 |
13 | a0666bb434 |
14 | 521c0b38b3 |
15 | 2b80a08501 |
hex | 18c9181015 |
106453012501 has 8 divisors (see below), whose sum is σ = 116134653600. Its totient is φ = 96772053840.
The previous prime is 106453012483. The next prime is 106453012507. The reversal of 106453012501 is 105210354601.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 106453012501 - 219 = 106452488213 is a prime.
It is a super-2 number, since 2×1064530125012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 106453012501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106453012507) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 188415 + ... + 498403.
It is an arithmetic number, because the mean of its divisors is an integer number (14516831700).
Almost surely, 2106453012501 is an apocalyptic number.
106453012501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
106453012501 is a deficient number, since it is larger than the sum of its proper divisors (9681641099).
106453012501 is a wasteful number, since it uses less digits than its factorization.
106453012501 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 341219.
The product of its (nonzero) digits is 3600, while the sum is 28.
The spelling of 106453012501 in words is "one hundred six billion, four hundred fifty-three million, twelve thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •