Base | Representation |
---|---|
bin | 101011101001000… |
… | …0011100101001111 |
3 | 10210001102202000021 |
4 | 1113102003211033 |
5 | 10444333213210 |
6 | 401150043011 |
7 | 51200531026 |
oct | 12722034517 |
9 | 3701382007 |
10 | 1464351055 |
11 | 691651692 |
12 | 34a4a9467 |
13 | 1a44c001b |
14 | dc6a38bd |
15 | 88856bda |
hex | 5748394f |
1464351055 has 8 divisors (see below), whose sum is σ = 1786028544. Its totient is φ = 1152276000.
The previous prime is 1464351043. The next prime is 1464351059. The reversal of 1464351055 is 5501534641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1464351055 - 29 = 1464350543 is a prime.
It is a super-2 number, since 2×14643510552 = 4288648024559226050, which contains 22 as substring.
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 1464351055.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1464351059) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2400271 + ... + 2400880.
It is an arithmetic number, because the mean of its divisors is an integer number (223253568).
Almost surely, 21464351055 is an apocalyptic number.
1464351055 is a deficient number, since it is larger than the sum of its proper divisors (321677489).
1464351055 is an equidigital number, since it uses as much as digits as its factorization.
1464351055 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4801217.
The product of its (nonzero) digits is 36000, while the sum is 34.
The square root of 1464351055 is about 38266.8401491422. The cubic root of 1464351055 is about 1135.5730266446.
Adding to 1464351055 its reverse (5501534641), we get a palindrome (6965885696).
The spelling of 1464351055 in words is "one billion, four hundred sixty-four million, three hundred fifty-one thousand, fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •