Base | Representation |
---|---|
bin | 10011000111110110100… |
… | …001100100010111011010 |
3 | 11122121220221220111100200 |
4 | 103013312201210113122 |
5 | 133012234330120442 |
6 | 2443404545243030 |
7 | 163640435241252 |
oct | 23076641442732 |
9 | 4577827814320 |
10 | 1314101020122 |
11 | 467341849330 |
12 | 192821933476 |
13 | 96bc4616227 |
14 | 4786223a962 |
15 | 242b1d6034c |
hex | 131f68645da |
1314101020122 has 48 divisors (see below), whose sum is σ = 3106180688832. Its totient is φ = 398196567360.
The previous prime is 1314101020079. The next prime is 1314101020139. The reversal of 1314101020122 is 2210201014131.
1314101020122 is a `hidden beast` number, since 1 + 31 + 410 + 1 + 0 + 201 + 22 = 666.
It is a super-2 number, since 2×13141010201222 (a number of 25 digits) contains 22 as substring.
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 = 1314101020095 and 1314101020104.
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, 5443078 + ... + 5679374.
It is an arithmetic number, because the mean of its divisors is an integer number (64712097684).
Almost surely, 21314101020122 is an apocalyptic number.
1314101020122 is an abundant number, since it is smaller than the sum of its proper divisors (1792079668710).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1314101020122 is a wasteful number, since it uses less digits than its factorization.
1314101020122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264403 (or 264400 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 1314101020122 its reverse (2210201014131), we get a palindrome (3524302034253).
The spelling of 1314101020122 in words is "one trillion, three hundred fourteen billion, one hundred one million, twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •