Base | Representation |
---|---|
bin | 1011111011110110111111… |
… | …1001000110111110011001 |
3 | 1201110112202121002100200121 |
4 | 2332331233321012332121 |
5 | 3210001402044043113 |
6 | 43524342443233241 |
7 | 2523051142225450 |
oct | 276755771067631 |
9 | 51415677070617 |
10 | 13123002331033 |
11 | 41aa485777631 |
12 | 157b3aab18821 |
13 | 742655b9200a |
14 | 335229dbdb97 |
15 | 17b55cee1e8d |
hex | bef6fe46f99 |
13123002331033 has 8 divisors (see below), whose sum is σ = 14997779324352. Its totient is φ = 11248240931376.
The previous prime is 13123002331031. The next prime is 13123002331129. The reversal of 13123002331033 is 33013320032131.
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 13123002331033 - 21 = 13123002331031 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13123002330989 and 13123002331007.
It is not an unprimeable number, because it can be changed into a prime (13123002331031) 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, 2035735 + ... + 5512732.
It is an arithmetic number, because the mean of its divisors is an integer number (1874722415544).
Almost surely, 213123002331033 is an apocalyptic number.
It is an amenable number.
13123002331033 is a deficient number, since it is larger than the sum of its proper divisors (1874776993319).
13123002331033 is an equidigital number, since it uses as much as digits as its factorization.
13123002331033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7796831.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 13123002331033 its reverse (33013320032131), we get a palindrome (46136322363164).
The spelling of 13123002331033 in words is "thirteen trillion, one hundred twenty-three billion, two million, three hundred thirty-one thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •