Base | Representation |
---|---|
bin | 1001001110000100111001… |
… | …0010101101001100100111 |
3 | 1022220010111100221222020002 |
4 | 2103201032102231030213 |
5 | 2312042432201021002 |
6 | 33321023550531515 |
7 | 2064256060116200 |
oct | 223411622551447 |
9 | 38803440858202 |
10 | 10137436345127 |
11 | 3259298597323 |
12 | 1178852b06b9b |
13 | 586c57861670 |
14 | 27092409a5a7 |
15 | 128a70a63002 |
hex | 9384e4ad327 |
10137436345127 has 24 divisors (see below), whose sum is σ = 12708896187456. Its totient is φ = 8014986237888.
The previous prime is 10137436345111. The next prime is 10137436345139. The reversal of 10137436345127 is 72154363473101.
It is not a de Polignac number, because 10137436345127 - 24 = 10137436345111 is a prime.
It is a super-2 number, since 2×101374363451272 (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 (10137436345027) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4920863 + ... + 6670064.
It is an arithmetic number, because the mean of its divisors is an integer number (529537341144).
Almost surely, 210137436345127 is an apocalyptic number.
10137436345127 is a deficient number, since it is larger than the sum of its proper divisors (2571459842329).
10137436345127 is a wasteful number, since it uses less digits than its factorization.
10137436345127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11592327 (or 11592320 counting only the distinct ones).
The product of its (nonzero) digits is 1270080, while the sum is 47.
The spelling of 10137436345127 in words is "ten trillion, one hundred thirty-seven billion, four hundred thirty-six million, three hundred forty-five thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •