Base | Representation |
---|---|
bin | 1100000110001010011010… |
… | …0011010001010010100101 |
3 | 1202002110122202220122022110 |
4 | 3001202212203101102211 |
5 | 3220401411312342013 |
6 | 44141535220351233 |
7 | 2541615502210221 |
oct | 301424643212245 |
9 | 52073582818273 |
10 | 13300013012133 |
11 | 426855a684221 |
12 | 15a976b545519 |
13 | 7562553c18c3 |
14 | 33da1cb93781 |
15 | 180e6d0662c3 |
hex | c18a68d14a5 |
13300013012133 has 8 divisors (see below), whose sum is σ = 17733382175200. Its totient is φ = 8866659595248.
The previous prime is 13300013012119. The next prime is 13300013012137. The reversal of 13300013012133 is 33121031000331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13300013012133 - 213 = 13300013003941 is a prime.
It is a super-2 number, since 2×133000130121332 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13300013012137) 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, 1800043 + ... + 5462616.
It is an arithmetic number, because the mean of its divisors is an integer number (2216672771900).
Almost surely, 213300013012133 is an apocalyptic number.
It is an amenable number.
13300013012133 is a deficient number, since it is larger than the sum of its proper divisors (4433369163067).
13300013012133 is an equidigital number, since it uses as much as digits as its factorization.
13300013012133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7873091.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 13300013012133 its reverse (33121031000331), we get a palindrome (46421044012464).
The spelling of 13300013012133 in words is "thirteen trillion, three hundred billion, thirteen million, twelve thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •