Base | Representation |
---|---|
bin | 1001011001111111011000… |
… | …0110110010010011101011 |
3 | 1100121200210210102221011102 |
4 | 2112133312012302103223 |
5 | 2323421123001134111 |
6 | 33555034022152015 |
7 | 2115123154133333 |
oct | 226376606622353 |
9 | 40550723387142 |
10 | 10342115255531 |
11 | 3328080497124 |
12 | 11b045558260b |
13 | 5a0346339277 |
14 | 27a7bd73a0c3 |
15 | 12e04eb6613b |
hex | 967f61b24eb |
10342115255531 has 8 divisors (see below), whose sum is σ = 10361306810640. Its totient is φ = 10322924740128.
The previous prime is 10342115255519. The next prime is 10342115255561. The reversal of 10342115255531 is 13555251124301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10342115255531 - 226 = 10342048146667 is a prime.
It is a super-2 number, since 2×103421152555312 (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 (10342115255561) 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, 21310205 + ... + 21790113.
It is an arithmetic number, because the mean of its divisors is an integer number (1295163351330).
Almost surely, 210342115255531 is an apocalyptic number.
10342115255531 is a deficient number, since it is larger than the sum of its proper divisors (19191555109).
10342115255531 is an equidigital number, since it uses as much as digits as its factorization.
10342115255531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519853.
The product of its (nonzero) digits is 90000, while the sum is 38.
Adding to 10342115255531 its reverse (13555251124301), we get a palindrome (23897366379832).
The spelling of 10342115255531 in words is "ten trillion, three hundred forty-two billion, one hundred fifteen million, two hundred fifty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •