Base | Representation |
---|---|
bin | 1110110101111101001… |
… | …1111000000010000111 |
3 | 220101012112110200121101 |
4 | 3231133103320002013 |
5 | 13134221020204411 |
6 | 313051340200531 |
7 | 24265122140002 |
oct | 3553723700207 |
9 | 811175420541 |
10 | 255002116231 |
11 | 99167057205 |
12 | 41507839147 |
13 | 1b07b4aba95 |
14 | c4b0ca4539 |
15 | 697703c8c1 |
hex | 3b5f4f8087 |
255002116231 has 8 divisors (see below), whose sum is σ = 258263420480. Its totient is φ = 251741647872.
The previous prime is 255002116183. The next prime is 255002116249. The reversal of 255002116231 is 132611200552.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 255002116231 - 229 = 254465245319 is a prime.
It is a super-2 number, since 2×2550021162312 (a number of 24 digits) 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 255002116231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255002116331) 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, 416971 + ... + 826963.
It is an arithmetic number, because the mean of its divisors is an integer number (32282927560).
Almost surely, 2255002116231 is an apocalyptic number.
255002116231 is a deficient number, since it is larger than the sum of its proper divisors (3261304249).
255002116231 is an equidigital number, since it uses as much as digits as its factorization.
255002116231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 417945.
The product of its (nonzero) digits is 3600, while the sum is 28.
Adding to 255002116231 its reverse (132611200552), we get a palindrome (387613316783).
The spelling of 255002116231 in words is "two hundred fifty-five billion, two million, one hundred sixteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •