Base | Representation |
---|---|
bin | 100100101010111… |
… | …1111011010001001 |
3 | 10011202101221202010 |
4 | 1021111333122021 |
5 | 10010002022023 |
6 | 322033530133 |
7 | 42331042653 |
oct | 11125773211 |
9 | 3152357663 |
10 | 1230501513 |
11 | 581649aaa |
12 | 2a4113949 |
13 | 167c13807 |
14 | b95cd6d3 |
15 | 73063093 |
hex | 4957f689 |
1230501513 has 8 divisors (see below), whose sum is σ = 1641938848. Its totient is φ = 819699264.
The previous prime is 1230501509. The next prime is 1230501521. The reversal of 1230501513 is 3151050321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1230501513 - 22 = 1230501509 is a prime.
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 1230501513.
It is not an unprimeable number, because it can be changed into a prime (1230501533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 154231 + ... + 162012.
It is an arithmetic number, because the mean of its divisors is an integer number (205242356).
Almost surely, 21230501513 is an apocalyptic number.
It is an amenable number.
1230501513 is a deficient number, since it is larger than the sum of its proper divisors (411437335).
1230501513 is a wasteful number, since it uses less digits than its factorization.
1230501513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 317543.
The product of its (nonzero) digits is 450, while the sum is 21.
The square root of 1230501513 is about 35078.5049995008. The cubic root of 1230501513 is about 1071.5868709675.
Adding to 1230501513 its reverse (3151050321), we get a palindrome (4381551834).
The spelling of 1230501513 in words is "one billion, two hundred thirty million, five hundred one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •