Base | Representation |
---|---|
bin | 111101000011110… |
… | …010111000011101 |
3 | 2122101121011111201 |
4 | 331003302320131 |
5 | 4044221430041 |
6 | 245352315501 |
7 | 34246204363 |
oct | 7503627035 |
9 | 2571534451 |
10 | 1024405021 |
11 | 486282722 |
12 | 2470a2b91 |
13 | 134303623 |
14 | 9a0a1633 |
15 | 5ee02631 |
hex | 3d0f2e1d |
1024405021 has 2 divisors, whose sum is σ = 1024405022. Its totient is φ = 1024405020.
The previous prime is 1024404991. The next prime is 1024405043. The reversal of 1024405021 is 1205044201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 697699396 + 326705625 = 26414^2 + 18075^2 .
It is a cyclic number.
It is not a de Polignac number, because 1024405021 - 215 = 1024372253 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1024405021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1024405321) 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, 512202510 + 512202511.
It is an arithmetic number, because the mean of its divisors is an integer number (512202511).
Almost surely, 21024405021 is an apocalyptic number.
It is an amenable number.
1024405021 is a deficient number, since it is larger than the sum of its proper divisors (1).
1024405021 is an equidigital number, since it uses as much as digits as its factorization.
1024405021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 320, while the sum is 19.
The square root of 1024405021 is about 32006.3278274781. The cubic root of 1024405021 is about 1008.0697115877.
Adding to 1024405021 its reverse (1205044201), we get a palindrome (2229449222).
The spelling of 1024405021 in words is "one billion, twenty-four million, four hundred five thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •