Base | Representation |
---|---|
bin | 1001001000000001000100… |
… | …1000110000010110100010 |
3 | 1022112011210002121010220012 |
4 | 2102000101020300112202 |
5 | 2303341230231030310 |
6 | 33201125414244522 |
7 | 2053612204203062 |
oct | 222002110602642 |
9 | 38464702533805 |
10 | 10033331111330 |
11 | 321912593131a |
12 | 116063a356742 |
13 | 57a1a66a66c7 |
14 | 269889b313a2 |
15 | 125ecb217c05 |
hex | 920112305a2 |
10033331111330 has 8 divisors (see below), whose sum is σ = 18059996000412. Its totient is φ = 4013332444528.
The previous prime is 10033331111233. The next prime is 10033331111369. The reversal of 10033331111330 is 3311113333001.
It can be written as a sum of positive squares in 2 ways, for example, as 9588566164681 + 444764946649 = 3096541^2 + 666907^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10033331111296 and 10033331111305.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 501666555557 + ... + 501666555576.
Almost surely, 210033331111330 is an apocalyptic number.
10033331111330 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10033331111330 is a deficient number, since it is larger than the sum of its proper divisors (8026664889082).
10033331111330 is a wasteful number, since it uses less digits than its factorization.
10033331111330 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1003333111140.
The product of its (nonzero) digits is 729, while the sum is 23.
Adding to 10033331111330 its reverse (3311113333001), we get a palindrome (13344444444331).
The spelling of 10033331111330 in words is "ten trillion, thirty-three billion, three hundred thirty-one million, one hundred eleven thousand, three hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •