Base | Representation |
---|---|
bin | 1000110100101001010… |
… | …11110001010110100111 |
3 | 1001222110111112222200112 |
4 | 10122110223301112213 |
5 | 14431313401304111 |
6 | 351132301403235 |
7 | 30621101203310 |
oct | 4322453612647 |
9 | 1058414488615 |
10 | 303142213031 |
11 | 10761a970479 |
12 | 4a90186951b |
13 | 22780b16868 |
14 | 1095a5a7607 |
15 | 7d43494e8b |
hex | 4694af15a7 |
303142213031 has 8 divisors (see below), whose sum is σ = 346525046304. Its totient is φ = 259778580480.
The previous prime is 303142213021. The next prime is 303142213043. The reversal of 303142213031 is 130312241303.
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 303142213031 - 218 = 303141950887 is a prime.
It is a super-2 number, since 2×3031422130312 (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 = 303142212988 and 303142213006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303142213021) 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, 4766330 + ... + 4829511.
It is an arithmetic number, because the mean of its divisors is an integer number (43315630788).
Almost surely, 2303142213031 is an apocalyptic number.
303142213031 is a deficient number, since it is larger than the sum of its proper divisors (43382833273).
303142213031 is an equidigital number, since it uses as much as digits as its factorization.
303142213031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9600361.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 303142213031 its reverse (130312241303), we get a palindrome (433454454334).
The spelling of 303142213031 in words is "three hundred three billion, one hundred forty-two million, two hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •