Base | Representation |
---|---|
bin | 100111000011100… |
… | …110101110100001 |
3 | 1200122222110220120 |
4 | 213003212232201 |
5 | 2320221201411 |
6 | 145004230453 |
7 | 22144405515 |
oct | 4703465641 |
9 | 1618873816 |
10 | 655256481 |
11 | 306969990 |
12 | 16353b429 |
13 | a59a4739 |
14 | 6304c145 |
15 | 3c7d5106 |
hex | 270e6ba1 |
655256481 has 16 divisors (see below), whose sum is σ = 954618048. Its totient is φ = 396492800.
The previous prime is 655256473. The next prime is 655256507. The reversal of 655256481 is 184652556.
655256481 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 655256481 - 23 = 655256473 is a prime.
It is a super-2 number, since 2×6552564812 = 858722111785006722, which contains 22 as substring.
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (655256461) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5665 + ... + 36641.
It is an arithmetic number, because the mean of its divisors is an integer number (59663628).
Almost surely, 2655256481 is an apocalyptic number.
It is an amenable number.
655256481 is a deficient number, since it is larger than the sum of its proper divisors (299361567).
655256481 is a wasteful number, since it uses less digits than its factorization.
655256481 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31632.
The product of its digits is 288000, while the sum is 42.
The square root of 655256481 is about 25597.9780646832. The cubic root of 655256481 is about 868.5679002346.
The spelling of 655256481 in words is "six hundred fifty-five million, two hundred fifty-six thousand, four hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •