Base | Representation |
---|---|
bin | 11110010000111000111010… |
… | …110011100100011110011001 |
3 | 122110021102120211202001100212 |
4 | 132100320322303210132121 |
5 | 114421220420403202223 |
6 | 1151030120354340505 |
7 | 40015206133046651 |
oct | 3620707263443631 |
9 | 573242524661325 |
10 | 133102023100313 |
11 | 39457284094233 |
12 | 12b1809228a735 |
13 | 593660ba994a7 |
14 | 24c225aaa5361 |
15 | 105c45094e278 |
hex | 790e3ace4799 |
133102023100313 has 16 divisors (see below), whose sum is σ = 137558512224000. Its totient is φ = 128723076892800.
The previous prime is 133102023100301. The next prime is 133102023100331. The reversal of 133102023100313 is 313001320201331.
It is a cyclic number.
It is not a de Polignac number, because 133102023100313 - 214 = 133102023083929 is a prime.
It is a super-2 number, since 2×1331020231003132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (133102023700313) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23930663 + ... + 28963436.
It is an arithmetic number, because the mean of its divisors is an integer number (8597407014000).
Almost surely, 2133102023100313 is an apocalyptic number.
It is an amenable number.
133102023100313 is a deficient number, since it is larger than the sum of its proper divisors (4456489123687).
133102023100313 is an equidigital number, since it uses as much as digits as its factorization.
133102023100313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52894832.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 133102023100313 its reverse (313001320201331), we get a palindrome (446103343301644).
The spelling of 133102023100313 in words is "one hundred thirty-three trillion, one hundred two billion, twenty-three million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •