Base | Representation |
---|---|
bin | 1001010111101101101010… |
… | …1001111011101100110011 |
3 | 1100110221211210012010201220 |
4 | 2111323122221323230303 |
5 | 2322301021000020311 |
6 | 33525044410400123 |
7 | 2112236642016342 |
oct | 225733251735463 |
9 | 40427753163656 |
10 | 10303000001331 |
11 | 33125289a1764 |
12 | 11a4959a30043 |
13 | 59975166c13b |
14 | 27894c877b59 |
15 | 12d010b96206 |
hex | 95edaa7bb33 |
10303000001331 has 8 divisors (see below), whose sum is σ = 14334608697600. Its totient is φ = 6570028986312.
The previous prime is 10303000001311. The next prime is 10303000001369. The reversal of 10303000001331 is 13310000030301.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10303000001331 - 29 = 10303000000819 is a prime.
It is a super-2 number, since 2×103030000013312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10303000001331.
It is not an unprimeable number, because it can be changed into a prime (10303000001311) 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, 74659420231 + ... + 74659420368.
It is an arithmetic number, because the mean of its divisors is an integer number (1791826087200).
Almost surely, 210303000001331 is an apocalyptic number.
10303000001331 is a deficient number, since it is larger than the sum of its proper divisors (4031608696269).
10303000001331 is a wasteful number, since it uses less digits than its factorization.
10303000001331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149318840625.
The product of its (nonzero) digits is 81, while the sum is 15.
Adding to 10303000001331 its reverse (13310000030301), we get a palindrome (23613000031632).
The spelling of 10303000001331 in words is "ten trillion, three hundred three billion, one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •