Base | Representation |
---|---|
bin | 1001001110110100010001… |
… | …1100111101001001111101 |
3 | 1022221100022211112121020011 |
4 | 2103231010130331021331 |
5 | 2312300004434133121 |
6 | 33330530052423221 |
7 | 2065216221560335 |
oct | 223550434751175 |
9 | 38840284477204 |
10 | 10150156161661 |
11 | 32637255a279a |
12 | 117b202917b11 |
13 | 588203b83319 |
14 | 2713ad5300c5 |
15 | 1290675bc7e1 |
hex | 93b4473d27d |
10150156161661 has 4 divisors (see below), whose sum is σ = 10223178868000. Its totient is φ = 10077133455324.
The previous prime is 10150156161623. The next prime is 10150156161701. The reversal of 10150156161661 is 16616165105101.
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 10150156161661 - 27 = 10150156161533 is a prime.
It is a super-2 number, since 2×101501561616612 (a number of 27 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 (10150156167661) 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, 36511352961 + ... + 36511353238.
It is an arithmetic number, because the mean of its divisors is an integer number (2555794717000).
Almost surely, 210150156161661 is an apocalyptic number.
It is an amenable number.
10150156161661 is a deficient number, since it is larger than the sum of its proper divisors (73022706339).
10150156161661 is an equidigital number, since it uses as much as digits as its factorization.
10150156161661 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 73022706338.
The product of its (nonzero) digits is 32400, while the sum is 40.
The spelling of 10150156161661 in words is "ten trillion, one hundred fifty billion, one hundred fifty-six million, one hundred sixty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •