Base | Representation |
---|---|
bin | 1001011000101110100001… |
… | …1100100000000000100100 |
3 | 1100112121210012111012200000 |
4 | 2112023220130200000210 |
5 | 2323042200233331434 |
6 | 33541044221421300 |
7 | 2113424261020563 |
oct | 226135034400044 |
9 | 40477705435600 |
10 | 10320411230244 |
11 | 33199530a5745 |
12 | 11a81b8a0a830 |
13 | 59b297905b5b |
14 | 279721001bda |
15 | 12d6ce4edb99 |
hex | 962e8720024 |
10320411230244 has 36 divisors (see below), whose sum is σ = 27053917507344. Its totient is φ = 3440137076424.
The previous prime is 10320411230201. The next prime is 10320411230263. The reversal of 10320411230244 is 44203211402301.
10320411230244 is a `hidden beast` number, since 1 + 0 + 3 + 2 + 0 + 411 + 2 + 3 + 0 + 244 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a super-2 number, since 2×103204112302442 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5308852542 + ... + 5308854485.
Almost surely, 210320411230244 is an apocalyptic number.
It is an amenable number.
10320411230244 is an abundant number, since it is smaller than the sum of its proper divisors (16733506277100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10320411230244 is a wasteful number, since it uses less digits than its factorization.
10320411230244 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10617707046 (or 10617707032 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 27.
Adding to 10320411230244 its reverse (44203211402301), we get a palindrome (54523622632545).
The spelling of 10320411230244 in words is "ten trillion, three hundred twenty billion, four hundred eleven million, two hundred thirty thousand, two hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.125 sec. • engine limits •