Base | Representation |
---|---|
bin | 111001111110111010101000… |
… | …010101101110101101100001 |
3 | 1020102220221002112212210112002 |
4 | 321332322220111232231201 |
5 | 231411110002400020340 |
6 | 2302210554303413345 |
7 | 104500011232250225 |
oct | 7176725025565541 |
9 | 1212827075783462 |
10 | 255012212501345 |
11 | 74289087890a12 |
12 | 247270a9bb4255 |
13 | ac3a718c51170 |
14 | 46d892a90a785 |
15 | 1e736bd669715 |
hex | e7eea856eb61 |
255012212501345 has 32 divisors (see below), whose sum is σ = 331582569276672. Its totient is φ = 187158041471232.
The previous prime is 255012212501317. The next prime is 255012212501407. The reversal of 255012212501345 is 543105212210552.
It is not a de Polignac number, because 255012212501345 - 210 = 255012212500321 is a prime.
It is a super-2 number, since 2×2550122125013452 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 255012212501299 and 255012212501308.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 63652979 + ... + 67540551.
It is an arithmetic number, because the mean of its divisors is an integer number (10361955289896).
Almost surely, 2255012212501345 is an apocalyptic number.
It is an amenable number.
255012212501345 is a deficient number, since it is larger than the sum of its proper divisors (76570356775327).
255012212501345 is a wasteful number, since it uses less digits than its factorization.
255012212501345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3893801.
The product of its (nonzero) digits is 120000, while the sum is 38.
Adding to 255012212501345 its reverse (543105212210552), we get a palindrome (798117424711897).
The spelling of 255012212501345 in words is "two hundred fifty-five trillion, twelve billion, two hundred twelve million, five hundred one thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •