Base | Representation |
---|---|
bin | 1000110000111001110… |
… | …00101110110001100101 |
3 | 1001210021102122002021101 |
4 | 10120130320232301211 |
5 | 14413204340010141 |
6 | 350201023120101 |
7 | 30520224460126 |
oct | 4303470566145 |
9 | 1053242562241 |
10 | 301132344421 |
11 | 1067893a3437 |
12 | 4a440743031 |
13 | 225205c56ac |
14 | 108096a004d |
15 | 7c76cd3531 |
hex | 461ce2ec65 |
301132344421 has 16 divisors (see below), whose sum is σ = 331762659840. Its totient is φ = 272055112560.
The previous prime is 301132344377. The next prime is 301132344433. The reversal of 301132344421 is 124443231103.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 301132344421 - 231 = 298984860773 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 301132344421.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301132342421) 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 15 ways as a sum of consecutive naturals, for example, 896275 + ... + 1185568.
It is an arithmetic number, because the mean of its divisors is an integer number (20735166240).
Almost surely, 2301132344421 is an apocalyptic number.
It is an amenable number.
301132344421 is a deficient number, since it is larger than the sum of its proper divisors (30630315419).
301132344421 is a wasteful number, since it uses less digits than its factorization.
301132344421 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2082216.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 301132344421 its reverse (124443231103), we get a palindrome (425575575524).
The spelling of 301132344421 in words is "three hundred one billion, one hundred thirty-two million, three hundred forty-four thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •