Base | Representation |
---|---|
bin | 101011001110101… |
… | …0000111101010011 |
3 | 10202002101122200111 |
4 | 1112131100331103 |
5 | 10432312342321 |
6 | 355533302151 |
7 | 50642102401 |
oct | 12635207523 |
9 | 3662348614 |
10 | 1450512211 |
11 | 68485a325 |
12 | 345934957 |
13 | 1a1686065 |
14 | da900471 |
15 | 875215e1 |
hex | 56750f53 |
1450512211 has 4 divisors (see below), whose sum is σ = 1454339800. Its totient is φ = 1446684624.
The previous prime is 1450512157. The next prime is 1450512241. The reversal of 1450512211 is 1122150541.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 1122150541 = 37 ⋅30328393.
It is a cyclic number.
It is not a de Polignac number, because 1450512211 - 213 = 1450504019 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1450512241) 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 3 ways as a sum of consecutive naturals, for example, 1913226 + ... + 1913983.
It is an arithmetic number, because the mean of its divisors is an integer number (363584950).
Almost surely, 21450512211 is an apocalyptic number.
1450512211 is a deficient number, since it is larger than the sum of its proper divisors (3827589).
1450512211 is an equidigital number, since it uses as much as digits as its factorization.
1450512211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3827588.
The product of its (nonzero) digits is 400, while the sum is 22.
The square root of 1450512211 is about 38085.5905953945. The cubic root of 1450512211 is about 1131.9844553610.
Adding to 1450512211 its reverse (1122150541), we get a palindrome (2572662752).
The spelling of 1450512211 in words is "one billion, four hundred fifty million, five hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •