Base | Representation |
---|---|
bin | 1110111100001101010… |
… | …0100010110101000011 |
3 | 220112112110201200102201 |
4 | 3233003110202311003 |
5 | 13201140040404443 |
6 | 313530035254031 |
7 | 24354525053452 |
oct | 3570324426503 |
9 | 815473650381 |
10 | 256680013123 |
11 | 999481a2a56 |
12 | 418b574a317 |
13 | 1b287cb9891 |
14 | c5cda74b99 |
15 | 6a244c734d |
hex | 3bc3522d43 |
256680013123 has 4 divisors (see below), whose sum is σ = 261030521880. Its totient is φ = 252329504368.
The previous prime is 256680013111. The next prime is 256680013147. The reversal of 256680013123 is 321310086652.
256680013123 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 256680013123 - 217 = 256679882051 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (256680013153) 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 3 ways as a sum of consecutive naturals, for example, 2175254290 + ... + 2175254407.
It is an arithmetic number, because the mean of its divisors is an integer number (65257630470).
Almost surely, 2256680013123 is an apocalyptic number.
256680013123 is a deficient number, since it is larger than the sum of its proper divisors (4350508757).
256680013123 is an equidigital number, since it uses as much as digits as its factorization.
256680013123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4350508756.
The product of its (nonzero) digits is 51840, while the sum is 37.
Adding to 256680013123 its reverse (321310086652), we get a palindrome (577990099775).
The spelling of 256680013123 in words is "two hundred fifty-six billion, six hundred eighty million, thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •