Base | Representation |
---|---|
bin | 10011000100000011011… |
… | …001110011111001101000 |
3 | 11122020101200202001120001 |
4 | 103010003121303321220 |
5 | 132430411130414422 |
6 | 2441452120312344 |
7 | 163434366214243 |
oct | 23040331637150 |
9 | 4566350661501 |
10 | 1310022123112 |
11 | 46563937766a |
12 | 191a839126b4 |
13 | 966c455c4c1 |
14 | 4759662a25a |
15 | 24123c03227 |
hex | 13103673e68 |
1310022123112 has 8 divisors (see below), whose sum is σ = 2456291480850. Its totient is φ = 655011061552.
The previous prime is 1310022123101. The next prime is 1310022123119. The reversal of 1310022123112 is 2113212200131.
It can be written as a sum of positive squares in only one way, i.e., 802231914276 + 507790208836 = 895674^2 + 712594^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a self number, because there is not a number n which added to its sum of digits gives 1310022123112.
It is not an unprimeable number, because it can be changed into a prime (1310022123119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 81876382687 + ... + 81876382702.
Almost surely, 21310022123112 is an apocalyptic number.
It is an amenable number.
1310022123112 is a deficient number, since it is larger than the sum of its proper divisors (1146269357738).
1310022123112 is a wasteful number, since it uses less digits than its factorization.
1310022123112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 163752765395 (or 163752765391 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 1310022123112 its reverse (2113212200131), we get a palindrome (3423234323243).
The spelling of 1310022123112 in words is "one trillion, three hundred ten billion, twenty-two million, one hundred twenty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.210 sec. • engine limits •