Base | Representation |
---|---|
bin | 11110010011111010100111… |
… | …010100100111100000001011 |
3 | 122111000022102020222121000112 |
4 | 132103322213110213200023 |
5 | 114433122341021224003 |
6 | 1151305434115024535 |
7 | 40036221061465643 |
oct | 3623724724474013 |
9 | 574008366877015 |
10 | 133310002133003 |
11 | 395274aa901823 |
12 | 12b50455b9b14b |
13 | 5950105199c87 |
14 | 24cc34a753523 |
15 | 1062a7462b3d8 |
hex | 793ea752780b |
133310002133003 has 16 divisors (see below), whose sum is σ = 146588195404800. Its totient is φ = 120670051582080.
The previous prime is 133310002132997. The next prime is 133310002133047. The reversal of 133310002133003 is 300331200013331.
It is a cyclic number.
It is not a de Polignac number, because 133310002133003 - 26 = 133310002132939 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (23).
It is a self number, because there is not a number n which added to its sum of digits gives 133310002133003.
It is not an unprimeable number, because it can be changed into a prime (133310002130003) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167031758 + ... + 167827971.
It is an arithmetic number, because the mean of its divisors is an integer number (9161762212800).
Almost surely, 2133310002133003 is an apocalyptic number.
133310002133003 is a deficient number, since it is larger than the sum of its proper divisors (13278193271797).
133310002133003 is a wasteful number, since it uses less digits than its factorization.
133310002133003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334860682.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 133310002133003 its reverse (300331200013331), we get a palindrome (433641202146334).
The spelling of 133310002133003 in words is "one hundred thirty-three trillion, three hundred ten billion, two million, one hundred thirty-three thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •