Base | Representation |
---|---|
bin | 1110110110110111001… |
… | …0111101101000100110 |
3 | 220101211110202220200110 |
4 | 3231231302331220212 |
5 | 13140220224143122 |
6 | 313131421153450 |
7 | 24304132643352 |
oct | 3555562755046 |
9 | 811743686613 |
10 | 255245146662 |
11 | 9928125a600 |
12 | 415750bb886 |
13 | 1b0b995107c |
14 | c4d5288462 |
15 | 698d54690c |
hex | 3b6dcbda26 |
255245146662 has 48 divisors (see below), whose sum is σ = 574803287856. Its totient is φ = 75460492800.
The previous prime is 255245146661. The next prime is 255245146669. The reversal of 255245146662 is 266641542552.
255245146662 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255245146661) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4257763 + ... + 4317294.
It is an arithmetic number, because the mean of its divisors is an integer number (11975068497).
Almost surely, 2255245146662 is an apocalyptic number.
255245146662 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
255245146662 is an abundant number, since it is smaller than the sum of its proper divisors (319558141194).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255245146662 is a wasteful number, since it uses less digits than its factorization.
255245146662 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8575125 (or 8575114 counting only the distinct ones).
The product of its digits is 3456000, while the sum is 48.
The spelling of 255245146662 in words is "two hundred fifty-five billion, two hundred forty-five million, one hundred forty-six thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •