Base | Representation |
---|---|
bin | 1001010111100010111001… |
… | …1010101101111000100111 |
3 | 1100110200101101202200211210 |
4 | 2111320232122231320213 |
5 | 2322224111221101211 |
6 | 33523445543002503 |
7 | 2112105223151634 |
oct | 225705632557047 |
9 | 40420341680753 |
10 | 10300110331431 |
11 | 3311285838a18 |
12 | 11a4292139433 |
13 | 5993b0aa72ab |
14 | 278756b9118b |
15 | 12cde21479a6 |
hex | 95e2e6ade27 |
10300110331431 has 32 divisors (see below), whose sum is σ = 13909207037440. Its totient is φ = 6779352412800.
The previous prime is 10300110331421. The next prime is 10300110331453. The reversal of 10300110331431 is 13413301100301.
It is not a de Polignac number, because 10300110331431 - 218 = 10300110069287 is a prime.
It is a super-2 number, since 2×103001103314312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10300110331398 and 10300110331407.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10300110331421) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 198155961 + ... + 198207933.
It is an arithmetic number, because the mean of its divisors is an integer number (434662719920).
Almost surely, 210300110331431 is an apocalyptic number.
10300110331431 is a deficient number, since it is larger than the sum of its proper divisors (3609096706009).
10300110331431 is a wasteful number, since it uses less digits than its factorization.
10300110331431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54247.
The product of its (nonzero) digits is 324, while the sum is 21.
Adding to 10300110331431 its reverse (13413301100301), we get a palindrome (23713411431732).
The spelling of 10300110331431 in words is "ten trillion, three hundred billion, one hundred ten million, three hundred thirty-one thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •