Base | Representation |
---|---|
bin | 111110011010000… |
… | …100011110010001 |
3 | 2200222011012102111 |
4 | 332122010132101 |
5 | 4121014141312 |
6 | 251521145321 |
7 | 34642351456 |
oct | 7632043621 |
9 | 2628135374 |
10 | 1047021457 |
11 | 49801a799 |
12 | 25278b241 |
13 | 138bc1931 |
14 | 9d0ab82d |
15 | 61dbd8a7 |
hex | 3e684791 |
1047021457 has 4 divisors (see below), whose sum is σ = 1051983856. Its totient is φ = 1042059060.
The previous prime is 1047021439. The next prime is 1047021463. The reversal of 1047021457 is 7541207401.
1047021457 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1047021457 - 223 = 1038632849 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1047021427) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2480883 + ... + 2481304.
It is an arithmetic number, because the mean of its divisors is an integer number (262995964).
Almost surely, 21047021457 is an apocalyptic number.
It is an amenable number.
1047021457 is a deficient number, since it is larger than the sum of its proper divisors (4962399).
1047021457 is an equidigital number, since it uses as much as digits as its factorization.
1047021457 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4962398.
The product of its (nonzero) digits is 7840, while the sum is 31.
The square root of 1047021457 is about 32357.7109357260. The cubic root of 1047021457 is about 1015.4343735224.
Adding to 1047021457 its reverse (7541207401), we get a palindrome (8588228858).
The spelling of 1047021457 in words is "one billion, forty-seven million, twenty-one thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •