Base | Representation |
---|---|
bin | 101010100111110… |
… | …0110010110110100 |
3 | 10200200002021120212 |
4 | 1111033212112310 |
5 | 10412104341003 |
6 | 353525044552 |
7 | 50304045122 |
oct | 12517462664 |
9 | 3620067525 |
10 | 1430152628 |
11 | 674313923 |
12 | 33ab56758 |
13 | 19a3a8078 |
14 | d7d20912 |
15 | 8584ddd8 |
hex | 553e65b4 |
1430152628 has 6 divisors (see below), whose sum is σ = 2502767106. Its totient is φ = 715076312.
The previous prime is 1430152621. The next prime is 1430152637. The reversal of 1430152628 is 8262510341.
It can be written as a sum of positive squares in only one way, i.e., 911315344 + 518837284 = 30188^2 + 22778^2 .
It is a junction number, because it is equal to n+sod(n) for n = 1430152594 and 1430152603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1430152621) 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 as a sum of consecutive naturals, namely, 178769075 + ... + 178769082.
It is an arithmetic number, because the mean of its divisors is an integer number (417127851).
Almost surely, 21430152628 is an apocalyptic number.
It is an amenable number.
1430152628 is a deficient number, since it is larger than the sum of its proper divisors (1072614478).
1430152628 is a wasteful number, since it uses less digits than its factorization.
1430152628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 357538161 (or 357538159 counting only the distinct ones).
The product of its (nonzero) digits is 11520, while the sum is 32.
The square root of 1430152628 is about 37817.3588184051. The cubic root of 1430152628 is about 1126.6632524824.
Adding to 1430152628 its reverse (8262510341), we get a palindrome (9692662969).
The spelling of 1430152628 in words is "one billion, four hundred thirty million, one hundred fifty-two thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •