Base | Representation |
---|---|
bin | 1001010100000101010101… |
… | …0110110001000011101011 |
3 | 1100020222212101200022200000 |
4 | 2111001111112301003223 |
5 | 2320240304310041011 |
6 | 33440252104114043 |
7 | 2104601313220431 |
oct | 225012526610353 |
9 | 40228771608600 |
10 | 10240634065131 |
11 | 3299034a58828 |
12 | 1194853765923 |
13 | 5938c29c1c02 |
14 | 275913ab0d51 |
15 | 12b5b089a356 |
hex | 950555b10eb |
10240634065131 has 96 divisors (see below), whose sum is σ = 15738245053440. Its totient is φ = 6651205456896.
The previous prime is 10240634065117. The next prime is 10240634065163. The reversal of 10240634065131 is 13156043604201.
10240634065131 is a `hidden beast` number, since 1 + 0 + 2 + 4 + 0 + 634 + 0 + 6 + 5 + 13 + 1 = 666.
It is not a de Polignac number, because 10240634065131 - 27 = 10240634065003 is a prime.
It is a super-2 number, since 2×102406340651312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10240634065031) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 2480170875 + ... + 2480175003.
It is an arithmetic number, because the mean of its divisors is an integer number (163940052640).
Almost surely, 210240634065131 is an apocalyptic number.
10240634065131 is a deficient number, since it is larger than the sum of its proper divisors (5497610988309).
10240634065131 is an equidigital number, since it uses as much as digits as its factorization.
10240634065131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5135 (or 5123 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
Adding to 10240634065131 its reverse (13156043604201), we get a palindrome (23396677669332).
The spelling of 10240634065131 in words is "ten trillion, two hundred forty billion, six hundred thirty-four million, sixty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •