Base | Representation |
---|---|
bin | 111010000101… |
… | …0001010001011 |
3 | 2010022000222110 |
4 | 1310022022023 |
5 | 30243402230 |
6 | 3004353403 |
7 | 516552300 |
oct | 164121213 |
9 | 63260873 |
10 | 30450315 |
11 | 16208855 |
12 | a245863 |
13 | 6401c4c |
14 | 40890a7 |
15 | 2a174b0 |
hex | 1d0a28b |
30450315 has 48 divisors (see below), whose sum is σ = 60033312. Its totient is φ = 13095936.
The previous prime is 30450311. The next prime is 30450323. The reversal of 30450315 is 51305403.
It is not a de Polignac number, because 30450315 - 22 = 30450311 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 30450291 and 30450300.
It is not an unprimeable number, because it can be changed into a prime (30450311) 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 47 ways as a sum of consecutive naturals, for example, 11277 + ... + 13713.
It is an arithmetic number, because the mean of its divisors is an integer number (1250694).
Almost surely, 230450315 is an apocalyptic number.
30450315 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
30450315 is a deficient number, since it is larger than the sum of its proper divisors (29582997).
30450315 is a wasteful number, since it uses less digits than its factorization.
30450315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2476 (or 2469 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 21.
The square root of 30450315 is about 5518.1804066196. The cubic root of 30450315 is about 312.2702396473.
Adding to 30450315 its reverse (51305403), we get a palindrome (81755718).
The spelling of 30450315 in words is "thirty million, four hundred fifty thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •