Base | Representation |
---|---|
bin | 101011101000011… |
… | …1011101101000001 |
3 | 10210000212210011001 |
4 | 1113100323231001 |
5 | 10444244303031 |
6 | 401135452001 |
7 | 51165163465 |
oct | 12720735501 |
9 | 3700783131 |
10 | 1464056641 |
11 | 691470473 |
12 | 34a387001 |
13 | 1a4419008 |
14 | dc6284a5 |
15 | 887e9861 |
hex | 5743bb41 |
1464056641 has 4 divisors (see below), whose sum is σ = 1464328192. Its totient is φ = 1463785092.
The previous prime is 1464056639. The next prime is 1464056653. The reversal of 1464056641 is 1466504641.
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, and also an emirpimes, since its reverse is a distinct semiprime: 1466504641 = 7 ⋅209500663.
It is a cyclic number.
It is not a de Polignac number, because 1464056641 - 21 = 1464056639 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1464056641.
It is not an unprimeable number, because it can be changed into a prime (1464056611) 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, 127521 + ... + 138526.
It is an arithmetic number, because the mean of its divisors is an integer number (366082048).
Almost surely, 21464056641 is an apocalyptic number.
It is an amenable number.
1464056641 is a deficient number, since it is larger than the sum of its proper divisors (271551).
1464056641 is an equidigital number, since it uses as much as digits as its factorization.
1464056641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 271550.
The product of its (nonzero) digits is 69120, while the sum is 37.
The square root of 1464056641 is about 38262.9931003836. The cubic root of 1464056641 is about 1135.4969176167.
The spelling of 1464056641 in words is "one billion, four hundred sixty-four million, fifty-six thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •