Base | Representation |
---|---|
bin | 10011000100001001010… |
… | …011011101011000110101 |
3 | 11122020122121000200120211 |
4 | 103010021103131120311 |
5 | 132431112001340313 |
6 | 2441510014225421 |
7 | 163440010534633 |
oct | 23041123353065 |
9 | 4566577020524 |
10 | 1310121121333 |
11 | 46568a244482 |
12 | 191ab0ab5271 |
13 | 9670bc1202b |
14 | 475a583a353 |
15 | 2412c75ae3d |
hex | 131094dd635 |
1310121121333 has 8 divisors (see below), whose sum is σ = 1312101181440. Its totient is φ = 1308142170480.
The previous prime is 1310121121207. The next prime is 1310121121369. The reversal of 1310121121333 is 3331211210131.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1310121121333 - 29 = 1310121120821 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1310121121633) 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 7 ways as a sum of consecutive naturals, for example, 2102028 + ... + 2653066.
It is an arithmetic number, because the mean of its divisors is an integer number (164012647680).
Almost surely, 21310121121333 is an apocalyptic number.
It is an amenable number.
1310121121333 is a deficient number, since it is larger than the sum of its proper divisors (1980060107).
1310121121333 is an equidigital number, since it uses as much as digits as its factorization.
1310121121333 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 554627.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 1310121121333 its reverse (3331211210131), we get a palindrome (4641332331464).
The spelling of 1310121121333 in words is "one trillion, three hundred ten billion, one hundred twenty-one million, one hundred twenty-one thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •