Base | Representation |
---|---|
bin | 1001000110001011010… |
… | …11110010010010101101 |
3 | 1002212202102221020122202 |
4 | 10203011223302102231 |
5 | 20110102341010203 |
6 | 355330241551245 |
7 | 31403246106614 |
oct | 4430553622255 |
9 | 1085672836582 |
10 | 312554235053 |
11 | 11060a798975 |
12 | 506a9945525 |
13 | 23620a57468 |
14 | 111b05d287b |
15 | 81e490c388 |
hex | 48c5af24ad |
312554235053 has 4 divisors (see below), whose sum is σ = 312572743008. Its totient is φ = 312535727100.
The previous prime is 312554235023. The next prime is 312554235079. The reversal of 312554235053 is 350532455213.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 312554235053 - 216 = 312554169517 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 312554234998 and 312554235016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312554235023) 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, 9228623 + ... + 9262428.
It is an arithmetic number, because the mean of its divisors is an integer number (78143185752).
Almost surely, 2312554235053 is an apocalyptic number.
It is an amenable number.
312554235053 is a deficient number, since it is larger than the sum of its proper divisors (18507955).
312554235053 is a wasteful number, since it uses less digits than its factorization.
312554235053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18507954.
The product of its (nonzero) digits is 270000, while the sum is 38.
The spelling of 312554235053 in words is "three hundred twelve billion, five hundred fifty-four million, two hundred thirty-five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •