Base | Representation |
---|---|
bin | 1001001101111100010011… |
… | …0100110010100100110001 |
3 | 1022212220112122012201202000 |
4 | 2103133010310302210301 |
5 | 2312023221241233431 |
6 | 33320003042244213 |
7 | 2064144653530455 |
oct | 223370464624461 |
9 | 38786478181660 |
10 | 10135130024241 |
11 | 3258314749302 |
12 | 117830a656669 |
13 | 58697aab5451 |
14 | 270785a64665 |
15 | 1289883439e6 |
hex | 937c4d32931 |
10135130024241 has 16 divisors (see below), whose sum is σ = 15898243176000. Its totient is φ = 6359297269824.
The previous prime is 10135130024237. The next prime is 10135130024251. The reversal of 10135130024241 is 14242003153101.
10135130024241 is a `hidden beast` number, since 1 + 0 + 1 + 351 + 30 + 0 + 242 + 41 = 666.
It is not a de Polignac number, because 10135130024241 - 22 = 10135130024237 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (10135130024251) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11040446191 + ... + 11040447108.
It is an arithmetic number, because the mean of its divisors is an integer number (993640198500).
Almost surely, 210135130024241 is an apocalyptic number.
It is an amenable number.
10135130024241 is a deficient number, since it is larger than the sum of its proper divisors (5763113151759).
10135130024241 is a wasteful number, since it uses less digits than its factorization.
10135130024241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22080893325 (or 22080893319 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
Adding to 10135130024241 its reverse (14242003153101), we get a palindrome (24377133177342).
The spelling of 10135130024241 in words is "ten trillion, one hundred thirty-five billion, one hundred thirty million, twenty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •