Base | Representation |
---|---|
bin | 1100000010000101… |
… | …1110010110000011 |
3 | 22100002211000201201 |
4 | 3000201132112003 |
5 | 23103340004030 |
6 | 1252302042031 |
7 | 143020360060 |
oct | 30041362603 |
9 | 8302730651 |
10 | 3230000515 |
11 | 1408284215 |
12 | 761879317 |
13 | 3c6243b11 |
14 | 228d97c67 |
15 | 13d8772ca |
hex | c085e583 |
3230000515 has 64 divisors (see below), whose sum is σ = 4841275392. Its totient is φ = 2020233600.
The previous prime is 3230000497. The next prime is 3230000519. The reversal of 3230000515 is 5150000323.
It is not a de Polignac number, because 3230000515 - 223 = 3221611907 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 3230000492 and 3230000501.
It is not an unprimeable number, because it can be changed into a prime (3230000519) 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 in 63 ways as a sum of consecutive naturals, for example, 1770894 + ... + 1772716.
It is an arithmetic number, because the mean of its divisors is an integer number (75644928).
Almost surely, 23230000515 is an apocalyptic number.
3230000515 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
3230000515 is a deficient number, since it is larger than the sum of its proper divisors (1611274877).
3230000515 is a wasteful number, since it uses less digits than its factorization.
3230000515 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1960.
The product of its (nonzero) digits is 450, while the sum is 19.
The square root of 3230000515 is about 56833.0934843424. The cubic root of 3230000515 is about 1478.2034011309.
Adding to 3230000515 its reverse (5150000323), we get a palindrome (8380000838).
The spelling of 3230000515 in words is "three billion, two hundred thirty million, five hundred fifteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •