Base | Representation |
---|---|
bin | 111001111110111101100111… |
… | …101110000101101011110011 |
3 | 1020102221020101022122001110211 |
4 | 321332331213232011223303 |
5 | 231411133041333211110 |
6 | 2302212245043004551 |
7 | 104500153631011600 |
oct | 7176754756055363 |
9 | 1212836338561424 |
10 | 255015423335155 |
11 | 7428a48526397a |
12 | 24727845369757 |
13 | ac3ab0b213c22 |
14 | 46d8b531156a7 |
15 | 1e7380a4a798a |
hex | e7ef67b85af3 |
255015423335155 has 12 divisors (see below), whose sum is σ = 355980713390640. Its totient is φ = 174867718858224.
The previous prime is 255015423335117. The next prime is 255015423335177. The reversal of 255015423335155 is 551533324510552.
It is a happy number.
It is not a de Polignac number, because 255015423335155 - 27 = 255015423335027 is a prime.
It is a super-2 number, since 2×2550154233351552 (a number of 30 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is a junction number, because it is equal to n+sod(n) for n = 255015423335099 and 255015423335108.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 520439639215 + ... + 520439639704.
It is an arithmetic number, because the mean of its divisors is an integer number (29665059449220).
Almost surely, 2255015423335155 is an apocalyptic number.
255015423335155 is a deficient number, since it is larger than the sum of its proper divisors (100965290055485).
255015423335155 is a wasteful number, since it uses less digits than its factorization.
255015423335155 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1040879278938 (or 1040879278931 counting only the distinct ones).
The product of its (nonzero) digits is 6750000, while the sum is 49.
The spelling of 255015423335155 in words is "two hundred fifty-five trillion, fifteen billion, four hundred twenty-three million, three hundred thirty-five thousand, one hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •