Base | Representation |
---|---|
bin | 101010000101101… |
… | …0110001010101000 |
3 | 10122102102021020012 |
4 | 1110023112022220 |
5 | 10343014314040 |
6 | 352045351052 |
7 | 46666005416 |
oct | 12413261250 |
9 | 3572367205 |
10 | 1412260520 |
11 | 665203260 |
12 | 334b68488 |
13 | 196782218 |
14 | d57c42b6 |
15 | 83eb7865 |
hex | 542d62a8 |
1412260520 has 32 divisors (see below), whose sum is σ = 3466458720. Its totient is φ = 513549120.
The previous prime is 1412260469. The next prime is 1412260523. The reversal of 1412260520 is 250622141.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (1412260523) 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 7 ways as a sum of consecutive naturals, for example, 1604402 + ... + 1605281.
It is an arithmetic number, because the mean of its divisors is an integer number (108326835).
Almost surely, 21412260520 is an apocalyptic number.
1412260520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1412260520 is an abundant number, since it is smaller than the sum of its proper divisors (2054198200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1412260520 is a wasteful number, since it uses less digits than its factorization.
1412260520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3209705 (or 3209701 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 23.
The square root of 1412260520 is about 37580.0548163517. The cubic root of 1412260520 is about 1121.9451000132.
Adding to 1412260520 its reverse (250622141), we get a palindrome (1662882661).
The spelling of 1412260520 in words is "one billion, four hundred twelve million, two hundred sixty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •