Base | Representation |
---|---|
bin | 1000110000111010000… |
… | …11110100101011110101 |
3 | 1001210021122002211000101 |
4 | 10120131003310223311 |
5 | 14413211111032323 |
6 | 350201205314101 |
7 | 30520261260505 |
oct | 4303503645365 |
9 | 1053248084011 |
10 | 301135252213 |
11 | 10678aaaa074 |
12 | 4a441705931 |
13 | 225210a3093 |
14 | 10809c19a05 |
15 | 7c771a9dad |
hex | 461d0f4af5 |
301135252213 has 4 divisors (see below), whose sum is σ = 301159844928. Its totient is φ = 301110659500.
The previous prime is 301135252211. The next prime is 301135252247. The reversal of 301135252213 is 312252531103.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 312252531103 = 827 ⋅377572589.
It is a cyclic number.
It is not a de Polignac number, because 301135252213 - 21 = 301135252211 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 (301135252211) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12277981 + ... + 12302482.
It is an arithmetic number, because the mean of its divisors is an integer number (75289961232).
Almost surely, 2301135252213 is an apocalyptic number.
It is an amenable number.
301135252213 is a deficient number, since it is larger than the sum of its proper divisors (24592715).
301135252213 is a wasteful number, since it uses less digits than its factorization.
301135252213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 24592714.
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 301135252213 its reverse (312252531103), we get a palindrome (613387783316).
The spelling of 301135252213 in words is "three hundred one billion, one hundred thirty-five million, two hundred fifty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •