Base | Representation |
---|---|
bin | 11110010100000011111011… |
… | …001111011101011111001101 |
3 | 122111001021020000201221221202 |
4 | 132110003323033131133031 |
5 | 114433303330000030442 |
6 | 1151314210144035245 |
7 | 40040023612124024 |
oct | 3624037317353715 |
9 | 574037200657852 |
10 | 133320000001997 |
11 | 395307703a0776 |
12 | 12b52386302b25 |
13 | 59510395bc4a3 |
14 | 24cca184bd8bb |
15 | 1062e5c217c32 |
hex | 7940fb3dd7cd |
133320000001997 has 16 divisors (see below), whose sum is σ = 136210418467200. Its totient is φ = 130451380224000.
The previous prime is 133320000001963. The next prime is 133320000002053. The reversal of 133320000001997 is 799100000023331.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133320000001997 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 133320000001997.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (133320000001927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 16666997 + ... + 23332997.
It is an arithmetic number, because the mean of its divisors is an integer number (8513151154200).
Almost surely, 2133320000001997 is an apocalyptic number.
It is an amenable number.
133320000001997 is a deficient number, since it is larger than the sum of its proper divisors (2890418465203).
133320000001997 is a wasteful number, since it uses less digits than its factorization.
133320000001997 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6667636.
The product of its (nonzero) digits is 30618, while the sum is 38.
The spelling of 133320000001997 in words is "one hundred thirty-three trillion, three hundred twenty billion, one thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •