Base | Representation |
---|---|
bin | 1100000110001010010111… |
… | …1001101011111011011011 |
3 | 1202002110122000101211001000 |
4 | 3001202211321223323123 |
5 | 3220401401020024240 |
6 | 44141534151000043 |
7 | 2541615310436112 |
oct | 301424571537333 |
9 | 52073560354030 |
10 | 13300002111195 |
11 | 4268554509188 |
12 | 15a9767969023 |
13 | 756253075c47 |
14 | 33da1b556c79 |
15 | 180e6c111430 |
hex | c18a5e6bedb |
13300002111195 has 128 divisors (see below), whose sum is σ = 25467132499200. Its totient is φ = 6572153548800.
The previous prime is 13300002111191. The next prime is 13300002111247. The reversal of 13300002111195 is 59111120000331.
It is a happy number.
13300002111195 is a `hidden beast` number, since 1 + 330 + 0 + 0 + 0 + 211 + 119 + 5 = 666.
It is not a de Polignac number, because 13300002111195 - 22 = 13300002111191 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (13300002111191) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 9112249 + ... + 10470581.
It is an arithmetic number, because the mean of its divisors is an integer number (198961972650).
Almost surely, 213300002111195 is an apocalyptic number.
13300002111195 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
13300002111195 is a deficient number, since it is larger than the sum of its proper divisors (12167130388005).
13300002111195 is a wasteful number, since it uses less digits than its factorization.
13300002111195 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1358478 (or 1358472 counting only the distinct ones).
The product of its (nonzero) digits is 810, while the sum is 27.
The spelling of 13300002111195 in words is "thirteen trillion, three hundred billion, two million, one hundred eleven thousand, one hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •