Base | Representation |
---|---|
bin | 10001111101110… |
… | …111010101111111 |
3 | 210000012020102101 |
4 | 101331313111333 |
5 | 1104131231033 |
6 | 45524405531 |
7 | 10320054040 |
oct | 2175672577 |
9 | 700166371 |
10 | 301430143 |
11 | 145170a23 |
12 | 84b468a7 |
13 | 4a5aba41 |
14 | 2c0668c7 |
15 | 1b6e297d |
hex | 11f7757f |
301430143 has 12 divisors (see below), whose sum is σ = 355970640. Its totient is φ = 250028640.
The previous prime is 301430141. The next prime is 301430149. The reversal of 301430143 is 341034103.
It is not a de Polignac number, because 301430143 - 21 = 301430141 is a prime.
It is a super-2 number, since 2×3014301432 = 181720262218000898, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
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 301430143.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (301430141) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15678 + ... + 29131.
It is an arithmetic number, because the mean of its divisors is an integer number (29664220).
Almost surely, 2301430143 is an apocalyptic number.
301430143 is a deficient number, since it is larger than the sum of its proper divisors (54540497).
301430143 is an equidigital number, since it uses as much as digits as its factorization.
301430143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44878 (or 44847 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 19.
The square root of 301430143 is about 17361.7436624321. The cubic root of 301430143 is about 670.4950251195.
Adding to 301430143 its reverse (341034103), we get a palindrome (642464246).
The spelling of 301430143 in words is "three hundred one million, four hundred thirty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •