Base | Representation |
---|---|
bin | 11110010001000001011001… |
… | …101011110111101010001110 |
3 | 122110022022002121001212212002 |
4 | 132101001121223313222032 |
5 | 114421343044031010110 |
6 | 1151034224234512302 |
7 | 40015650626623103 |
oct | 3621013153675216 |
9 | 573268077055762 |
10 | 133111131110030 |
11 | 39460128347797 |
12 | 12b199b4595692 |
13 | 5937430a35c58 |
14 | 24c2882594aaa |
15 | 105c7d5363aa5 |
hex | 791059af7a8e |
133111131110030 has 16 divisors (see below), whose sum is σ = 239601513448224. Its totient is φ = 53244124121760.
The previous prime is 133111131109969. The next prime is 133111131110047. The reversal of 133111131110030 is 30011131111331.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 133111131109984 and 133111131110011.
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, 39334106 + ... + 42583965.
It is an arithmetic number, because the mean of its divisors is an integer number (14975094590514).
Almost surely, 2133111131110030 is an apocalyptic number.
133111131110030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
133111131110030 is a deficient number, since it is larger than the sum of its proper divisors (106490382338194).
133111131110030 is a wasteful number, since it uses less digits than its factorization.
133111131110030 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 82080571.
The product of its (nonzero) digits is 81, while the sum is 20.
Adding to 133111131110030 its reverse (30011131111331), we get a palindrome (163122262221361).
The spelling of 133111131110030 in words is "one hundred thirty-three trillion, one hundred eleven billion, one hundred thirty-one million, one hundred ten thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •