Base | Representation |
---|---|
bin | 10011001101000100… |
… | …10011011110100101 |
3 | 222121112110121001112 |
4 | 21212202103132211 |
5 | 132103403001201 |
6 | 4423023234405 |
7 | 513332165516 |
oct | 114642233645 |
9 | 28545417045 |
10 | 10310203301 |
11 | 4410928382 |
12 | 1bb8a48a05 |
13 | c8404b518 |
14 | 6db430a0d |
15 | 4052350bb |
hex | 2668937a5 |
10310203301 has 8 divisors (see below), whose sum is σ = 11005704000. Its totient is φ = 9629988480.
The previous prime is 10310203271. The next prime is 10310203313. The reversal of 10310203301 is 10330201301.
10310203301 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 10310203301 - 222 = 10306008997 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10310203361) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3820076 + ... + 3822773.
It is an arithmetic number, because the mean of its divisors is an integer number (1375713000).
Almost surely, 210310203301 is an apocalyptic number.
It is an amenable number.
10310203301 is a deficient number, since it is larger than the sum of its proper divisors (695500699).
10310203301 is an equidigital number, since it uses as much as digits as its factorization.
10310203301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7642939.
The product of its (nonzero) digits is 54, while the sum is 14.
Adding to 10310203301 its reverse (10330201301), we get a palindrome (20640404602).
The spelling of 10310203301 in words is "ten billion, three hundred ten million, two hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •