Base | Representation |
---|---|
bin | 1001000101100100101… |
… | …11010110101100011110 |
3 | 1002211220212001002110100 |
4 | 10202302113112230132 |
5 | 20103421402041110 |
6 | 355234142521530 |
7 | 31362232106544 |
oct | 4426227265436 |
9 | 1084825032410 |
10 | 312230112030 |
11 | 110463838501 |
12 | 506192962a6 |
13 | 2359b8616a5 |
14 | 1117d53dd94 |
15 | 81c6235bc0 |
hex | 48b25d6b1e |
312230112030 has 48 divisors (see below), whose sum is σ = 813026582784. Its totient is φ = 83135384640.
The previous prime is 312230112001. The next prime is 312230112091. The reversal of 312230112030 is 30211032213.
312230112030 is a `hidden beast` number, since 312 + 2 + 301 + 1 + 20 + 30 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 312230111994 and 312230112012.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2564734 + ... + 2683713.
It is an arithmetic number, because the mean of its divisors is an integer number (16938053808).
Almost surely, 2312230112030 is an apocalyptic number.
312230112030 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
312230112030 is an abundant number, since it is smaller than the sum of its proper divisors (500796470754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
312230112030 is a wasteful number, since it uses less digits than its factorization.
312230112030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5249121 (or 5249118 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 312230112030 its reverse (30211032213), we get a palindrome (342441144243).
The spelling of 312230112030 in words is "three hundred twelve billion, two hundred thirty million, one hundred twelve thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •