Base | Representation |
---|---|
bin | 1011111011001… |
… | …01100000010001 |
3 | 20222020002000122 |
4 | 11331211200101 |
5 | 201101433411 |
6 | 13532000025 |
7 | 2323150025 |
oct | 575454021 |
9 | 228202018 |
10 | 100030481 |
11 | 51512421 |
12 | 29600015 |
13 | 17954645 |
14 | d3dc385 |
15 | 8bad9db |
hex | 5f65811 |
100030481 has 2 divisors, whose sum is σ = 100030482. Its totient is φ = 100030480.
The previous prime is 100030471. The next prime is 100030487. The reversal of 100030481 is 184030001.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 57988225 + 42042256 = 7615^2 + 6484^2 .
It is an emirp because it is prime and its reverse (184030001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 100030481 - 218 = 99768337 is a prime.
It is a super-2 number, since 2×1000304812 = 20012194258182722, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100030487) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50015240 + 50015241.
It is an arithmetic number, because the mean of its divisors is an integer number (50015241).
Almost surely, 2100030481 is an apocalyptic number.
It is an amenable number.
100030481 is a deficient number, since it is larger than the sum of its proper divisors (1).
100030481 is an equidigital number, since it uses as much as digits as its factorization.
100030481 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 17.
The square root of 100030481 is about 10001.5239338813. The cubic root of 100030481 is about 464.2060386602.
Adding to 100030481 its reverse (184030001), we get a palindrome (284060482).
The spelling of 100030481 in words is "one hundred million, thirty thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •