Base | Representation |
---|---|
bin | 1001001110011010110000… |
… | …1010011011100001001001 |
3 | 1022220200122110010112221102 |
4 | 2103212230022123201021 |
5 | 2312141442341414121 |
6 | 33323434234151145 |
7 | 2064554404064120 |
oct | 223465412334111 |
9 | 38820573115842 |
10 | 10143306201161 |
11 | 326082aa08011 |
12 | 1179a108824b5 |
13 | 587681991263 |
14 | 270d1d8acab7 |
15 | 128cb603e90b |
hex | 939ac29b849 |
10143306201161 has 8 divisors (see below), whose sum is σ = 11605876613760. Its totient is φ = 8684117455968.
The previous prime is 10143306201137. The next prime is 10143306201167. The reversal of 10143306201161 is 16110260334101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10143306201161 - 218 = 10143305939017 is a prime.
It is a super-2 number, since 2×101433062011612 (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 (10143306201167) 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, 845410421 + ... + 845422418.
It is an arithmetic number, because the mean of its divisors is an integer number (1450734576720).
Almost surely, 210143306201161 is an apocalyptic number.
It is an amenable number.
10143306201161 is a deficient number, since it is larger than the sum of its proper divisors (1462570412599).
10143306201161 is an equidigital number, since it uses as much as digits as its factorization.
10143306201161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1690833703.
The product of its (nonzero) digits is 2592, while the sum is 29.
Adding to 10143306201161 its reverse (16110260334101), we get a palindrome (26253566535262).
The spelling of 10143306201161 in words is "ten trillion, one hundred forty-three billion, three hundred six million, two hundred one thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •