Base | Representation |
---|---|
bin | 1001010100010111101110… |
… | …0111101101111001011111 |
3 | 1100021110121110102010001021 |
4 | 2111011323213231321133 |
5 | 2320330412134311033 |
6 | 33442430024025011 |
7 | 2105134541445220 |
oct | 225057347557137 |
9 | 40243543363037 |
10 | 10245571010143 |
11 | 32a0138808677 |
12 | 11957b1002167 |
13 | 5941cb774151 |
14 | 275c6163b247 |
15 | 12b79dee8b2d |
hex | 9517b9ede5f |
10245571010143 has 4 divisors (see below), whose sum is σ = 11709224011600. Its totient is φ = 8781918008688.
The previous prime is 10245571010141. The next prime is 10245571010149. The reversal of 10245571010143 is 34101017554201.
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 10245571010143 - 21 = 10245571010141 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10245571010099 and 10245571010108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10245571010141) 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, 731826500718 + ... + 731826500731.
It is an arithmetic number, because the mean of its divisors is an integer number (2927306002900).
Almost surely, 210245571010143 is an apocalyptic number.
10245571010143 is a deficient number, since it is larger than the sum of its proper divisors (1463653001457).
10245571010143 is an equidigital number, since it uses as much as digits as its factorization.
10245571010143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1463653001456.
The product of its (nonzero) digits is 16800, while the sum is 34.
Adding to 10245571010143 its reverse (34101017554201), we get a palindrome (44346588564344).
The spelling of 10245571010143 in words is "ten trillion, two hundred forty-five billion, five hundred seventy-one million, ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •