Base | Representation |
---|---|
bin | 1001000101001011111… |
… | …10010001111101000111 |
3 | 1002211101100211200210220 |
4 | 10202211332101331013 |
5 | 20103010141244143 |
6 | 355201354515423 |
7 | 31354126021335 |
oct | 4424576217507 |
9 | 1084340750726 |
10 | 312022212423 |
11 | 11036744a449 |
12 | 5057b735b73 |
13 | 2356776c87c |
14 | 1115daa2b55 |
15 | 81b2d6ad83 |
hex | 48a5f91f47 |
312022212423 has 8 divisors (see below), whose sum is σ = 416032916208. Its totient is φ = 208013158464.
The previous prime is 312022212409. The next prime is 312022212497. The reversal of 312022212423 is 324212220213.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 312022212423 - 25 = 312022212391 is a prime.
It is a super-5 number, since 5×3120222124235 (a number of 59 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 312022212393 and 312022212402.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312022214423) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 131211 + ... + 800787.
It is an arithmetic number, because the mean of its divisors is an integer number (52004114526).
Almost surely, 2312022212423 is an apocalyptic number.
312022212423 is a deficient number, since it is larger than the sum of its proper divisors (104010703785).
312022212423 is a wasteful number, since it uses less digits than its factorization.
312022212423 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 824913.
The product of its (nonzero) digits is 2304, while the sum is 24.
Adding to 312022212423 its reverse (324212220213), we get a palindrome (636234432636).
The spelling of 312022212423 in words is "three hundred twelve billion, twenty-two million, two hundred twelve thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •