Base | Representation |
---|---|
bin | 100011011111000011011000… |
… | …0000011100111101011110001 |
3 | 1111221011102221212110111000112 |
4 | 1012332012300003213223301 |
5 | 311402424004140304301 |
6 | 3023503015304231105 |
7 | 122513504634453425 |
oct | 10676066003475361 |
9 | 1457142855414015 |
10 | 312131112041201 |
11 | 90500074562472 |
12 | 2b011125a6b495 |
13 | 10521ab71a486b |
14 | 5711325474b85 |
15 | 26143a70569bb |
hex | 11be1b00e7af1 |
312131112041201 has 16 divisors (see below), whose sum is σ = 314790163488768. Its totient is φ = 309475259755200.
The previous prime is 312131112041171. The next prime is 312131112041209. The reversal of 312131112041201 is 102140211131213.
It is a cyclic number.
It is not a de Polignac number, because 312131112041201 - 214 = 312131112024817 is a prime.
It is a super-2 number, since 2×3121311120412012 (a number of 30 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (312131112041209) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1526726456 + ... + 1526930886.
It is an arithmetic number, because the mean of its divisors is an integer number (19674385218048).
Almost surely, 2312131112041201 is an apocalyptic number.
It is an amenable number.
312131112041201 is a deficient number, since it is larger than the sum of its proper divisors (2659051447567).
312131112041201 is a wasteful number, since it uses less digits than its factorization.
312131112041201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 212192.
The product of its (nonzero) digits is 288, while the sum is 23.
Adding to 312131112041201 its reverse (102140211131213), we get a palindrome (414271323172414).
The spelling of 312131112041201 in words is "three hundred twelve trillion, one hundred thirty-one billion, one hundred twelve million, forty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •