Base | Representation |
---|---|
bin | 100011010110111010110001… |
… | …1110110010111101000101100 |
3 | 1111210012120021121121011001111 |
4 | 1012231311203312113220230 |
5 | 311231114403323032340 |
6 | 3021245244234321404 |
7 | 122336646410100610 |
oct | 10655654366275054 |
9 | 1453176247534044 |
10 | 311013142002220 |
11 | 90109a29623199 |
12 | 2aa7051bb89264 |
13 | 1047054b459338 |
14 | 56b318b53d340 |
15 | 25e5273b69aea |
hex | 11add63d97a2c |
311013142002220 has 24 divisors (see below), whose sum is σ = 746431540805664. Its totient is φ = 106633077257856.
The previous prime is 311013142002203. The next prime is 311013142002229. The reversal of 311013142002220 is 22200241310113.
It is a junction number, because it is equal to n+sod(n) for n = 311013142002191 and 311013142002200.
It is not an unprimeable number, because it can be changed into a prime (311013142002229) 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, 1110761221297 + ... + 1110761221576.
It is an arithmetic number, because the mean of its divisors is an integer number (31101314200236).
Almost surely, 2311013142002220 is an apocalyptic number.
It is an amenable number.
311013142002220 is an abundant number, since it is smaller than the sum of its proper divisors (435418398803444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
311013142002220 is a wasteful number, since it uses less digits than its factorization.
311013142002220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2221522442889 (or 2221522442887 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 311013142002220 its reverse (22200241310113), we get a palindrome (333213383312333).
The spelling of 311013142002220 in words is "three hundred eleven trillion, thirteen billion, one hundred forty-two million, two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •