Base | Representation |
---|---|
bin | 1001001110100010011101… |
… | …0000100110001010100110 |
3 | 1022220212222101012022000111 |
4 | 2103220213100212022212 |
5 | 2312210210040241311 |
6 | 33324415211003234 |
7 | 2064656522110246 |
oct | 223504720461246 |
9 | 38825871168014 |
10 | 10145371415206 |
11 | 326169a746985 |
12 | 117a2a843951a |
13 | 5879207bc8c1 |
14 | 271077ca1b26 |
15 | 128d874d4d21 |
hex | 93a274262a6 |
10145371415206 has 8 divisors (see below), whose sum is σ = 15629355964080. Its totient is φ = 4935586093848.
The previous prime is 10145371415173. The next prime is 10145371415209. The reversal of 10145371415206 is 60251417354101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×101453714152062 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10145371415209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 68549806786 + ... + 68549806933.
It is an arithmetic number, because the mean of its divisors is an integer number (1953669495510).
Almost surely, 210145371415206 is an apocalyptic number.
10145371415206 is a deficient number, since it is larger than the sum of its proper divisors (5483984548874).
10145371415206 is a wasteful number, since it uses less digits than its factorization.
10145371415206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137099613758.
The product of its (nonzero) digits is 100800, while the sum is 40.
Adding to 10145371415206 its reverse (60251417354101), we get a palindrome (70396788769307).
The spelling of 10145371415206 in words is "ten trillion, one hundred forty-five billion, three hundred seventy-one million, four hundred fifteen thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •