Base | Representation |
---|---|
bin | 1110110111100010000… |
… | …1011011100111010101 |
3 | 220102022000101111120222 |
4 | 3231320201123213111 |
5 | 13141102311201440 |
6 | 313201330204125 |
7 | 24311446346360 |
oct | 3557041334725 |
9 | 812260344528 |
10 | 255425100245 |
11 | 993638a0377 |
12 | 41605423645 |
13 | 1b118009a93 |
14 | c51112d0d7 |
15 | 699e2412b5 |
hex | 3b7885b9d5 |
255425100245 has 8 divisors (see below), whose sum is σ = 350297280384. Its totient is φ = 175148640144.
The previous prime is 255425100223. The next prime is 255425100269. The reversal of 255425100245 is 542001524552.
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 255425100245 - 232 = 251130132949 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35), and also a Moran number because the ratio is a prime number: 7297860007 = 255425100245 / (2 + 5 + 5 + 4 + 2 + 5 + 1 + 0 + 0 + 2 + 4 + 5).
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3648929969 + ... + 3648930038.
It is an arithmetic number, because the mean of its divisors is an integer number (43787160048).
Almost surely, 2255425100245 is an apocalyptic number.
It is an amenable number.
255425100245 is a deficient number, since it is larger than the sum of its proper divisors (94872180139).
255425100245 is an equidigital number, since it uses as much as digits as its factorization.
255425100245 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7297860019.
The product of its (nonzero) digits is 80000, while the sum is 35.
Adding to 255425100245 its reverse (542001524552), we get a palindrome (797426624797).
The spelling of 255425100245 in words is "two hundred fifty-five billion, four hundred twenty-five million, one hundred thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •