Base | Representation |
---|---|
bin | 1001010111110101101001… |
… | …1010001010010101100111 |
3 | 1100111011101011021120020022 |
4 | 2111331122122022111213 |
5 | 2322314413144210011 |
6 | 33530041214025355 |
7 | 2112344026131203 |
oct | 225753232122547 |
9 | 40434334246208 |
10 | 10305143350631 |
11 | 3313428848818 |
12 | 11a52577a825b |
13 | 599a0372716c |
14 | 278ab33a9b03 |
15 | 12d0d8e228db |
hex | 95f5a68a567 |
10305143350631 has 8 divisors (see below), whose sum is σ = 10772292885120. Its totient is φ = 9839585468152.
The previous prime is 10305143350553. The next prime is 10305143350651. The reversal of 10305143350631 is 13605334150301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10305143350631 - 222 = 10305139156327 is a prime.
It is a super-2 number, since 2×103051433506312 (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 = 10305143350591 and 10305143350600.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10305143350651) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 397899761 + ... + 397925658.
It is an arithmetic number, because the mean of its divisors is an integer number (1346536610640).
Almost surely, 210305143350631 is an apocalyptic number.
10305143350631 is a deficient number, since it is larger than the sum of its proper divisors (467149534489).
10305143350631 is an equidigital number, since it uses as much as digits as its factorization.
10305143350631 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 795826005.
The product of its (nonzero) digits is 48600, while the sum is 35.
The spelling of 10305143350631 in words is "ten trillion, three hundred five billion, one hundred forty-three million, three hundred fifty thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •