Base | Representation |
---|---|
bin | 10011001011111110… |
… | …10001110000011101 |
3 | 222120220012002121012 |
4 | 21211333101300131 |
5 | 132044030134323 |
6 | 4422054345005 |
7 | 513161143550 |
oct | 114577216035 |
9 | 28526162535 |
10 | 10301021213 |
11 | 440672677a |
12 | 1bb595b165 |
13 | c82185032 |
14 | 6da120697 |
15 | 40451e678 |
hex | 265fd1c1d |
10301021213 has 8 divisors (see below), whose sum is σ = 11775344832. Its totient is φ = 8827384896.
The previous prime is 10301021189. The next prime is 10301021221. The reversal of 10301021213 is 31212010301.
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 10301021213 - 28 = 10301020957 is a prime.
It is a super-2 number, since 2×103010212132 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10301021233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 139295 + ... + 200012.
It is an arithmetic number, because the mean of its divisors is an integer number (1471918104).
Almost surely, 210301021213 is an apocalyptic number.
It is an amenable number.
10301021213 is a deficient number, since it is larger than the sum of its proper divisors (1474323619).
10301021213 is an equidigital number, since it uses as much as digits as its factorization.
10301021213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 343651.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 10301021213 its reverse (31212010301), we get a palindrome (41513031514).
The spelling of 10301021213 in words is "ten billion, three hundred one million, twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •