Base | Representation |
---|---|
bin | 10010001100010… |
… | …011101110101111 |
3 | 210021022121020021 |
4 | 102030103232233 |
5 | 1111113411211 |
6 | 50141503011 |
7 | 10364203552 |
oct | 2214235657 |
9 | 707277207 |
10 | 305216431 |
11 | 147317693 |
12 | 86271a67 |
13 | 4b306250 |
14 | 2c770699 |
15 | 1bbde771 |
hex | 12313baf |
305216431 has 8 divisors (see below), whose sum is σ = 333198320. Its totient is φ = 277877952.
The previous prime is 305216413. The next prime is 305216473. The reversal of 305216431 is 134612503.
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 305216431 - 29 = 305215919 is a prime.
It is a super-2 number, since 2×3052164312 = 186314139504755522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 305216396 and 305216405.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (305216231) 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, 159861 + ... + 161758.
It is an arithmetic number, because the mean of its divisors is an integer number (41649790).
Almost surely, 2305216431 is an apocalyptic number.
305216431 is a deficient number, since it is larger than the sum of its proper divisors (27981889).
305216431 is a wasteful number, since it uses less digits than its factorization.
305216431 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321705.
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 305216431 is about 17470.4444992107. Note that the first 4 decimals coincide. The cubic root of 305216431 is about 673.2907323362.
Adding to 305216431 its reverse (134612503), we get a palindrome (439828934).
The spelling of 305216431 in words is "three hundred five million, two hundred sixteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •