Base | Representation |
---|---|
bin | 100101010111111… |
… | …0010101110100010 |
3 | 10020101200221221122 |
4 | 1022233302232202 |
5 | 10032013330110 |
6 | 324234252242 |
7 | 43035120446 |
oct | 11257625642 |
9 | 3211627848 |
10 | 1254042530 |
11 | 593968794 |
12 | 2abb87082 |
13 | 16ca66900 |
14 | bc79a826 |
15 | 75163255 |
hex | 4abf2ba2 |
1254042530 has 24 divisors (see below), whose sum is σ = 2444273172. Its totient is φ = 463030464.
The previous prime is 1254042529. The next prime is 1254042533. The reversal of 1254042530 is 352404521.
It is a happy number.
It can be written as a sum of positive squares in 6 ways, for example, as 5621641 + 1248420889 = 2371^2 + 35333^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 1254042530.
It is not an unprimeable number, because it can be changed into a prime (1254042533) 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 11 ways as a sum of consecutive naturals, for example, 369329 + ... + 372708.
Almost surely, 21254042530 is an apocalyptic number.
1254042530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1254042530 is a deficient number, since it is larger than the sum of its proper divisors (1190230642).
1254042530 is a wasteful number, since it uses less digits than its factorization.
1254042530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 742070 (or 742057 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 26.
The square root of 1254042530 is about 35412.4629191475. The cubic root of 1254042530 is about 1078.3773443403.
The spelling of 1254042530 in words is "one billion, two hundred fifty-four million, forty-two thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •