Base | Representation |
---|---|
bin | 1001101001010110111101… |
… | …0101010011111000001011 |
3 | 1101112221022021112212222012 |
4 | 2122111233111103320023 |
5 | 2342232334340024433 |
6 | 34320221110050135 |
7 | 2143161042313220 |
oct | 232255725237013 |
9 | 41487267485865 |
10 | 10606142111243 |
11 | 341a0487a1708 |
12 | 123365b64994b |
13 | 5bc20244aa83 |
14 | 2894a9015947 |
15 | 135d5411a848 |
hex | 9a56f553e0b |
10606142111243 has 4 divisors (see below), whose sum is σ = 12121305270000. Its totient is φ = 9090978952488.
The previous prime is 10606142111233. The next prime is 10606142111263. The reversal of 10606142111243 is 34211124160601.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 10606142111243 - 214 = 10606142094859 is a prime.
It is a super-2 number, since 2×106061421112432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10606142111203) 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, 757581579368 + ... + 757581579381.
It is an arithmetic number, because the mean of its divisors is an integer number (3030326317500).
Almost surely, 210606142111243 is an apocalyptic number.
10606142111243 is a deficient number, since it is larger than the sum of its proper divisors (1515163158757).
10606142111243 is an equidigital number, since it uses as much as digits as its factorization.
10606142111243 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1515163158756.
The product of its (nonzero) digits is 6912, while the sum is 32.
Adding to 10606142111243 its reverse (34211124160601), we get a palindrome (44817266271844).
The spelling of 10606142111243 in words is "ten trillion, six hundred six billion, one hundred forty-two million, one hundred eleven thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •