Base | Representation |
---|---|
bin | 1001001100001110100000… |
… | …0010010011111010011101 |
3 | 1022210002110112122011200101 |
4 | 2103003220002103322131 |
5 | 2311032340414001112 |
6 | 33254250235501101 |
7 | 2062052401464214 |
oct | 223035002237235 |
9 | 38702415564611 |
10 | 10105656000157 |
11 | 324686a3a3813 |
12 | 11726638b7791 |
13 | 583c6169b903 |
14 | 26d18b41407b |
15 | 127d109b4757 |
hex | 930e8093e9d |
10105656000157 has 4 divisors (see below), whose sum is σ = 10113048580896. Its totient is φ = 10098263419420.
The previous prime is 10105656000137. The next prime is 10105656000173. The reversal of 10105656000157 is 75100065650101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 10105656000157 - 227 = 10105521782429 is a prime.
It is a super-3 number, since 3×101056560001573 (a number of 40 digits) contains 333 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 (10105656000137) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3696288319 + ... + 3696291052.
It is an arithmetic number, because the mean of its divisors is an integer number (2528262145224).
Almost surely, 210105656000157 is an apocalyptic number.
It is an amenable number.
10105656000157 is a deficient number, since it is larger than the sum of its proper divisors (7392580739).
10105656000157 is an equidigital number, since it uses as much as digits as its factorization.
10105656000157 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7392580738.
The product of its (nonzero) digits is 31500, while the sum is 37.
The spelling of 10105656000157 in words is "ten trillion, one hundred five billion, six hundred fifty-six million, one hundred fifty-seven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •