Base | Representation |
---|---|
bin | 1001010100000111001011… |
… | …1011100001101111111111 |
3 | 1100021001010222022200000220 |
4 | 2111001302323201233333 |
5 | 2320242313320203043 |
6 | 33440413230552423 |
7 | 2104616516516403 |
oct | 225016273415777 |
9 | 40231128280026 |
10 | 10241130241023 |
11 | 329926a043050 |
12 | 1194971968713 |
13 | 593971738506 |
14 | 27595d94d103 |
15 | 12b5de20a483 |
hex | 95072ee1bff |
10241130241023 has 16 divisors (see below), whose sum is σ = 15376711683072. Its totient is φ = 6006528000000.
The previous prime is 10241130241003. The next prime is 10241130241091. The reversal of 10241130241023 is 32014203114201.
It is not a de Polignac number, because 10241130241023 - 221 = 10241128143871 is a prime.
It is a super-2 number, since 2×102411302410232 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10241130240984 and 10241130241002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10241130241003) 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, 5005438978 + ... + 5005441023.
It is an arithmetic number, because the mean of its divisors is an integer number (961044480192).
Almost surely, 210241130241023 is an apocalyptic number.
10241130241023 is a deficient number, since it is larger than the sum of its proper divisors (5135581442049).
10241130241023 is a wasteful number, since it uses less digits than its factorization.
10241130241023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10010880046.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 10241130241023 its reverse (32014203114201), we get a palindrome (42255333355224).
The spelling of 10241130241023 in words is "ten trillion, two hundred forty-one billion, one hundred thirty million, two hundred forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •