Base | Representation |
---|---|
bin | 1001011011111010000101… |
… | …0011110010110011101001 |
3 | 1100201211211020101012121201 |
4 | 2112332201103302303221 |
5 | 2324441101344343312 |
6 | 34022122214204201 |
7 | 2120400316550110 |
oct | 226764123626351 |
9 | 40654736335551 |
10 | 10375052340457 |
11 | 3340042629572 |
12 | 11b6908053661 |
13 | 5a3495057b2c |
14 | 27c225c90c77 |
15 | 12ed2b557557 |
hex | 96fa14f2ce9 |
10375052340457 has 8 divisors (see below), whose sum is σ = 12266071732800. Its totient is φ = 8586250212624.
The previous prime is 10375052340451. The next prime is 10375052340487. The reversal of 10375052340457 is 75404325057301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10375052340457 - 27 = 10375052340329 is a prime.
It is a super-2 number, since 2×103750523404572 (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 (10375052340451) 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, 25554315907 + ... + 25554316312.
It is an arithmetic number, because the mean of its divisors is an integer number (1533258966600).
Almost surely, 210375052340457 is an apocalyptic number.
It is an amenable number.
10375052340457 is a deficient number, since it is larger than the sum of its proper divisors (1891019392343).
10375052340457 is an equidigital number, since it uses as much as digits as its factorization.
10375052340457 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51108632255.
The product of its (nonzero) digits is 1764000, while the sum is 46.
Adding to 10375052340457 its reverse (75404325057301), we get a palindrome (85779377397758).
The spelling of 10375052340457 in words is "ten trillion, three hundred seventy-five billion, fifty-two million, three hundred forty thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •