Base | Representation |
---|---|
bin | 1000101111001110010… |
… | …11101000110011010111 |
3 | 1001200221122012212021002 |
4 | 10113213023220303113 |
5 | 14404333210043111 |
6 | 345531355213515 |
7 | 30456004131002 |
oct | 4274713506327 |
9 | 1050848185232 |
10 | 300231331031 |
11 | 106366839775 |
12 | 4a22aa4729b |
13 | 22408a35988 |
14 | 10761b5c539 |
15 | 7c22b5663b |
hex | 45e72e8cd7 |
300231331031 has 8 divisors (see below), whose sum is σ = 307589519328. Its totient is φ = 292874832000.
The previous prime is 300231331021. The next prime is 300231331033. The reversal of 300231331031 is 130133132003.
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-300231331031 is a prime.
It is a super-2 number, since 2×3002313310312 (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 = 300231330994 and 300231331012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (300231331033) 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, 58715 + ... + 777116.
It is an arithmetic number, because the mean of its divisors is an integer number (38448689916).
Almost surely, 2300231331031 is an apocalyptic number.
300231331031 is a deficient number, since it is larger than the sum of its proper divisors (7358188297).
300231331031 is an equidigital number, since it uses as much as digits as its factorization.
300231331031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 844633.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 300231331031 its reverse (130133132003), we get a palindrome (430364463034).
The spelling of 300231331031 in words is "three hundred billion, two hundred thirty-one million, three hundred thirty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •