Base | Representation |
---|---|
bin | 10011110100100100010… |
… | …100101001101010010101 |
3 | 11211012212001211220122120 |
4 | 103310210110221222111 |
5 | 134304102142314013 |
6 | 2521425130450153 |
7 | 200260312121520 |
oct | 23644424515225 |
9 | 4735761756576 |
10 | 1362114026133 |
11 | 48573a948393 |
12 | 19bba1293959 |
13 | 9b5a6813763 |
14 | 49cd8ad9bb7 |
15 | 25672061123 |
hex | 13d24529a95 |
1362114026133 has 32 divisors (see below), whose sum is σ = 2147389820160. Its totient is φ = 751435937280.
The previous prime is 1362114026059. The next prime is 1362114026183. The reversal of 1362114026133 is 3316204112631.
It is not a de Polignac number, because 1362114026133 - 226 = 1362046917269 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1362114026094 and 1362114026103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1362114026183) 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 in 31 ways as a sum of consecutive naturals, for example, 6273753 + ... + 6487233.
It is an arithmetic number, because the mean of its divisors is an integer number (67105931880).
Almost surely, 21362114026133 is an apocalyptic number.
It is an amenable number.
1362114026133 is a deficient number, since it is larger than the sum of its proper divisors (785275794027).
1362114026133 is a wasteful number, since it uses less digits than its factorization.
1362114026133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 223997.
The product of its (nonzero) digits is 15552, while the sum is 33.
Adding to 1362114026133 its reverse (3316204112631), we get a palindrome (4678318138764).
The spelling of 1362114026133 in words is "one trillion, three hundred sixty-two billion, one hundred fourteen million, twenty-six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •