Base | Representation |
---|---|
bin | 11110011001011… |
… | …11111101010010 |
3 | 122202211100210100 |
4 | 33030233331102 |
5 | 1010240003102 |
6 | 41145313230 |
7 | 6214316256 |
oct | 1714577522 |
9 | 582740710 |
10 | 255000402 |
11 | 120a39638 |
12 | 71495816 |
13 | 40aa3717 |
14 | 25c1c266 |
15 | 175c0a1c |
hex | f32ff52 |
255000402 has 96 divisors (see below), whose sum is σ = 601001856. Its totient is φ = 77932800.
The previous prime is 255000371. The next prime is 255000479. The reversal of 255000402 is 204000552.
255000402 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1408752 + ... + 1408932.
It is an arithmetic number, because the mean of its divisors is an integer number (6260436).
Almost surely, 2255000402 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 255000402, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (300500928).
255000402 is an abundant number, since it is smaller than the sum of its proper divisors (346001454).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
255000402 is a wasteful number, since it uses less digits than its factorization.
255000402 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 336 (or 333 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 18.
The square root of 255000402 is about 15968.7320097746. The cubic root of 255000402 is about 634.1329037688.
Adding to 255000402 its reverse (204000552), we get a palindrome (459000954).
The spelling of 255000402 in words is "two hundred fifty-five million, four hundred two", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •