Base | Representation |
---|---|
bin | 101011001110101… |
… | …0001011001011011 |
3 | 10202002101202011011 |
4 | 1112131101121123 |
5 | 10432312422021 |
6 | 355533314351 |
7 | 50642110552 |
oct | 12635213133 |
9 | 3662352134 |
10 | 1450514011 |
11 | 684860711 |
12 | 3459359b7 |
13 | 1a1686b1b |
14 | da900d99 |
15 | 87521de1 |
hex | 5675165b |
1450514011 has 4 divisors (see below), whose sum is σ = 1454554800. Its totient is φ = 1446473224.
The previous prime is 1450513951. The next prime is 1450514029. The reversal of 1450514011 is 1104150541.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1450514011 - 29 = 1450513499 is a prime.
It is a super-2 number, since 2×14505140112 = 4207981792214616242, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1450514111) 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, 2019856 + ... + 2020573.
It is an arithmetic number, because the mean of its divisors is an integer number (363638700).
Almost surely, 21450514011 is an apocalyptic number.
1450514011 is a deficient number, since it is larger than the sum of its proper divisors (4040789).
1450514011 is an equidigital number, since it uses as much as digits as its factorization.
1450514011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4040788.
The product of its (nonzero) digits is 400, while the sum is 22.
The square root of 1450514011 is about 38085.6142263716. The cubic root of 1450514011 is about 1131.9849236027.
Adding to 1450514011 its reverse (1104150541), we get a palindrome (2554664552).
The spelling of 1450514011 in words is "one billion, four hundred fifty million, five hundred fourteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •