Base | Representation |
---|---|
bin | 1000110001001111001… |
… | …10110101000101000111 |
3 | 1001210201222001202011022 |
4 | 10120213212311011013 |
5 | 14414041410413111 |
6 | 350230530101355 |
7 | 30524540310332 |
oct | 4304746650507 |
9 | 1053658052138 |
10 | 301312201031 |
11 | 106870978366 |
12 | 4a490a1a85b |
13 | 2254b94921a |
14 | 1082551b619 |
15 | 7c879ae2db |
hex | 46279b5147 |
301312201031 has 8 divisors (see below), whose sum is σ = 302646824064. Its totient is φ = 299979923320.
The previous prime is 301312200997. The next prime is 301312201067. The reversal of 301312201031 is 130102213103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-301312201031 is a prime.
It is a super-2 number, since 2×3013122010312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301312201331) 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, 328565 + ... + 842958.
It is an arithmetic number, because the mean of its divisors is an integer number (37830853008).
Almost surely, 2301312201031 is an apocalyptic number.
301312201031 is a deficient number, since it is larger than the sum of its proper divisors (1334623033).
301312201031 is a wasteful number, since it uses less digits than its factorization.
301312201031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1172661.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 301312201031 its reverse (130102213103), we get a palindrome (431414414134).
The spelling of 301312201031 in words is "three hundred one billion, three hundred twelve million, two hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •