Base | Representation |
---|---|
bin | 1110110110110010000… |
… | …0011110000001011101 |
3 | 220101202222002020100211 |
4 | 3231230200132001131 |
5 | 13140144210140443 |
6 | 313125325452421 |
7 | 24303451065022 |
oct | 3555440360135 |
9 | 811688066324 |
10 | 255223521373 |
11 | 9927002a167 |
12 | 41569a11111 |
13 | 1b0b531bc42 |
14 | c4d2459549 |
15 | 698b6c419d |
hex | 3b6c81e05d |
255223521373 has 8 divisors (see below), whose sum is σ = 256582126080. Its totient is φ = 253865149920.
The previous prime is 255223521359. The next prime is 255223521391. The reversal of 255223521373 is 373125322552.
255223521373 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 255223521373 - 229 = 254686650461 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (255223521073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2413473 + ... + 2517001.
It is an arithmetic number, because the mean of its divisors is an integer number (32072765760).
Almost surely, 2255223521373 is an apocalyptic number.
It is an amenable number.
255223521373 is a deficient number, since it is larger than the sum of its proper divisors (1358604707).
255223521373 is a wasteful number, since it uses less digits than its factorization.
255223521373 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116627.
The product of its digits is 378000, while the sum is 40.
The spelling of 255223521373 in words is "two hundred fifty-five billion, two hundred twenty-three million, five hundred twenty-one thousand, three hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •