Base | Representation |
---|---|
bin | 1001001110011001110110… |
… | …0000110100001101110101 |
3 | 1022220200000022122010120111 |
4 | 2103212131200310031311 |
5 | 2312140441431130003 |
6 | 33323354014103021 |
7 | 2064545330645350 |
oct | 223463540641565 |
9 | 38820008563514 |
10 | 10143060411253 |
11 | 326071419a460 |
12 | 11799624aaa71 |
13 | 587642a93c43 |
14 | 270cd8dab297 |
15 | 128c9e68ce6d |
hex | 9399d834375 |
10143060411253 has 32 divisors (see below), whose sum is σ = 12853800732672. Its totient is φ = 7773753470400.
The previous prime is 10143060411241. The next prime is 10143060411283. The reversal of 10143060411253 is 35211406034101.
10143060411253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10143060411253 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10143060411283) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 146619850 + ... + 146689012.
It is an arithmetic number, because the mean of its divisors is an integer number (401681272896).
Almost surely, 210143060411253 is an apocalyptic number.
It is an amenable number.
10143060411253 is a deficient number, since it is larger than the sum of its proper divisors (2710740321419).
10143060411253 is a wasteful number, since it uses less digits than its factorization.
10143060411253 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 100465.
The product of its (nonzero) digits is 8640, while the sum is 31.
Adding to 10143060411253 its reverse (35211406034101), we get a palindrome (45354466445354).
The spelling of 10143060411253 in words is "ten trillion, one hundred forty-three billion, sixty million, four hundred eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •