Base | Representation |
---|---|
bin | 111101001101110… |
… | …001101010000001 |
3 | 2122120112002120011 |
4 | 331031301222001 |
5 | 4100404141231 |
6 | 245524344521 |
7 | 34310352415 |
oct | 7515615201 |
9 | 2576462504 |
10 | 1027021441 |
11 | 4877aa456 |
12 | 247b45141 |
13 | 134a0b4c4 |
14 | 9a582d45 |
15 | 6026c9b1 |
hex | 3d371a81 |
1027021441 has 4 divisors (see below), whose sum is σ = 1035108352. Its totient is φ = 1018934532.
The previous prime is 1027021397. The next prime is 1027021447. The reversal of 1027021441 is 1441207201.
1027021441 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 1027021441 - 27 = 1027021313 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1027021447) 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, 4043265 + ... + 4043518.
It is an arithmetic number, because the mean of its divisors is an integer number (258777088).
Almost surely, 21027021441 is an apocalyptic number.
It is an amenable number.
1027021441 is a deficient number, since it is larger than the sum of its proper divisors (8086911).
1027021441 is an equidigital number, since it uses as much as digits as its factorization.
1027021441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8086910.
The product of its (nonzero) digits is 448, while the sum is 22.
The square root of 1027021441 is about 32047.1752421333. The cubic root of 1027021441 is about 1008.9272146860.
Adding to 1027021441 its reverse (1441207201), we get a palindrome (2468228642).
The spelling of 1027021441 in words is "one billion, twenty-seven million, twenty-one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •