Base | Representation |
---|---|
bin | 1001001101110100010111… |
… | …1111001000101111010001 |
3 | 1022212201001100000102110201 |
4 | 2103131011333020233101 |
5 | 2312004342004430113 |
6 | 33315011544055201 |
7 | 2064041144060641 |
oct | 223350577105721 |
9 | 38781040012421 |
10 | 10133002030033 |
11 | 325742252a803 |
12 | 1177a15a64501 |
13 | 5866cbc7558c |
14 | 2706231ac521 |
15 | 1288b15ebcdd |
hex | 93745fc8bd1 |
10133002030033 has 4 divisors (see below), whose sum is σ = 10142661708900. Its totient is φ = 10123342351168.
The previous prime is 10133002030003. The next prime is 10133002030127. The reversal of 10133002030033 is 33003020033101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 9592294762449 + 540707267584 = 3097143^2 + 735328^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10133002030033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10133002030003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4829837860 + ... + 4829839957.
It is an arithmetic number, because the mean of its divisors is an integer number (2535665427225).
Almost surely, 210133002030033 is an apocalyptic number.
It is an amenable number.
10133002030033 is a deficient number, since it is larger than the sum of its proper divisors (9659678867).
10133002030033 is an equidigital number, since it uses as much as digits as its factorization.
10133002030033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9659678866.
The product of its (nonzero) digits is 486, while the sum is 19.
Adding to 10133002030033 its reverse (33003020033101), we get a palindrome (43136022063134).
The spelling of 10133002030033 in words is "ten trillion, one hundred thirty-three billion, two million, thirty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •