Base | Representation |
---|---|
bin | 10010000100001… |
… | …001010001001111 |
3 | 210010021212201000 |
4 | 102010021101033 |
5 | 1110041421211 |
6 | 50023551343 |
7 | 10340051520 |
oct | 2204112117 |
9 | 703255630 |
10 | 303076431 |
11 | 146095899 |
12 | 855bb553 |
13 | 4aa37188 |
14 | 2c374847 |
15 | 1b91a656 |
hex | 1210944f |
303076431 has 32 divisors (see below), whose sum is σ = 513976320. Its totient is φ = 172906272.
The previous prime is 303076399. The next prime is 303076439. The reversal of 303076431 is 134670303.
It is a happy number.
It is not a de Polignac number, because 303076431 - 25 = 303076399 is a prime.
It is a super-2 number, since 2×3030764312 = 183710646055395522, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 303076395 and 303076404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (303076439) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 190666 + ... + 192248.
It is an arithmetic number, because the mean of its divisors is an integer number (16061760).
Almost surely, 2303076431 is an apocalyptic number.
303076431 is a deficient number, since it is larger than the sum of its proper divisors (210899889).
303076431 is a wasteful number, since it uses less digits than its factorization.
303076431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2612 (or 2606 counting only the distinct ones).
The product of its (nonzero) digits is 4536, while the sum is 27.
The square root of 303076431 is about 17409.0904702112. The cubic root of 303076431 is about 671.7134660118.
The spelling of 303076431 in words is "three hundred three million, seventy-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •