Base | Representation |
---|---|
bin | 11110010011110010010110… |
… | …100000000111111001101110 |
3 | 122110222110111221111122100002 |
4 | 132103302112200013321232 |
5 | 114433001203240031110 |
6 | 1151301405502304302 |
7 | 40035455160561614 |
oct | 3623622640077156 |
9 | 573873457448302 |
10 | 133301130002030 |
11 | 39523767807481 |
12 | 12b4a79a888092 |
13 | 594c32006a533 |
14 | 24cbb483056b4 |
15 | 10627057abaa5 |
hex | 793c96807e6e |
133301130002030 has 16 divisors (see below), whose sum is σ = 242184482921520. Its totient is φ = 52822130019072.
The previous prime is 133301130002011. The next prime is 133301130002041. The reversal of 133301130002030 is 30200031103331.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 133301130001993 and 133301130002011.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 62290246595 + ... + 62290248734.
It is an arithmetic number, because the mean of its divisors is an integer number (15136530182595).
Almost surely, 2133301130002030 is an apocalyptic number.
133301130002030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133301130002030 is a deficient number, since it is larger than the sum of its proper divisors (108883352919490).
133301130002030 is a wasteful number, since it uses less digits than its factorization.
133301130002030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124580495443.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 133301130002030 its reverse (30200031103331), we get a palindrome (163501161105361).
The spelling of 133301130002030 in words is "one hundred thirty-three trillion, three hundred one billion, one hundred thirty million, two thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •