Base | Representation |
---|---|
bin | 1001000101010111111… |
… | …11001100001000101111 |
3 | 1002211122101201000210111 |
4 | 10202223333030020233 |
5 | 20103212004122111 |
6 | 355215401320451 |
7 | 31356462460201 |
oct | 4425377141057 |
9 | 1084571630714 |
10 | 312123114031 |
11 | 1104093a7303 |
12 | 505a9496127 |
13 | 2358263a871 |
14 | 1116d24a771 |
15 | 81bbb4ca21 |
hex | 48abfcc22f |
312123114031 has 4 divisors (see below), whose sum is σ = 314368604200. Its totient is φ = 309877623864.
The previous prime is 312123114013. The next prime is 312123114041. The reversal of 312123114031 is 130411321213.
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 312123114031 - 25 = 312123113999 is a prime.
It is a super-2 number, since 2×3121231140312 (a number of 24 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 = 312123113993 and 312123114011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (312123114001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1122744876 + ... + 1122745153.
It is an arithmetic number, because the mean of its divisors is an integer number (78592151050).
Almost surely, 2312123114031 is an apocalyptic number.
312123114031 is a deficient number, since it is larger than the sum of its proper divisors (2245490169).
312123114031 is a wasteful number, since it uses less digits than its factorization.
312123114031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2245490168.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 312123114031 its reverse (130411321213), we get a palindrome (442534435244).
The spelling of 312123114031 in words is "three hundred twelve billion, one hundred twenty-three million, one hundred fourteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •