Base | Representation |
---|---|
bin | 1000110000101011011… |
… | …01101001110111010101 |
3 | 1001202222001011222001111 |
4 | 10120111231221313111 |
5 | 14412433033001323 |
6 | 350141043455021 |
7 | 30514233533311 |
oct | 4302555516725 |
9 | 1052861158044 |
10 | 301012000213 |
11 | 106727477011 |
12 | 4a408387471 |
13 | 225016aabc2 |
14 | 107d76d4b41 |
15 | 7c6b460c0d |
hex | 4615b69dd5 |
301012000213 has 8 divisors (see below), whose sum is σ = 310792079360. Its totient is φ = 291236297040.
The previous prime is 301012000193. The next prime is 301012000253. The reversal of 301012000213 is 312000210103.
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 301012000213 - 25 = 301012000181 is a prime.
It is a super-2 number, since 2×3010120002132 (a number of 24 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 = 301012000193 and 301012000202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301012000253) 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, 953898 + ... + 1229611.
It is an arithmetic number, because the mean of its divisors is an integer number (38849009920).
Almost surely, 2301012000213 is an apocalyptic number.
It is an amenable number.
301012000213 is a deficient number, since it is larger than the sum of its proper divisors (9780079147).
301012000213 is a wasteful number, since it uses less digits than its factorization.
301012000213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2187987.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 301012000213 its reverse (312000210103), we get a palindrome (613012210316).
The spelling of 301012000213 in words is "three hundred one billion, twelve million, two hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •