Base | Representation |
---|---|
bin | 1001011001100011000001… |
… | …0100100111100001110011 |
3 | 1100120222011012210202200112 |
4 | 2112120300110213201303 |
5 | 2323310030004302311 |
6 | 33551334340211535 |
7 | 2114433410553041 |
oct | 226306024474163 |
9 | 40528135722615 |
10 | 10334502025331 |
11 | 3324923a78640 |
12 | 11aaa8b999bab |
13 | 59c701c84823 |
14 | 27a29a591391 |
15 | 12dc565b928b |
hex | 96630527873 |
10334502025331 has 48 divisors (see below), whose sum is σ = 12106884222720. Its totient is φ = 8746034880000.
The previous prime is 10334502025327. The next prime is 10334502025349. The reversal of 10334502025331 is 13352020543301.
It is not a de Polignac number, because 10334502025331 - 22 = 10334502025327 is a prime.
It is a super-2 number, since 2×103345020253312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (10334502025231) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 331016840 + ... + 331048058.
It is an arithmetic number, because the mean of its divisors is an integer number (252226754640).
Almost surely, 210334502025331 is an apocalyptic number.
10334502025331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
10334502025331 is a deficient number, since it is larger than the sum of its proper divisors (1772382197389).
10334502025331 is a wasteful number, since it uses less digits than its factorization.
10334502025331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 32396 (or 32379 counting only the distinct ones).
The product of its (nonzero) digits is 32400, while the sum is 32.
Adding to 10334502025331 its reverse (13352020543301), we get a palindrome (23686522568632).
The spelling of 10334502025331 in words is "ten trillion, three hundred thirty-four billion, five hundred two million, twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •