Base | Representation |
---|---|
bin | 10000011111001101111… |
… | …111010000101000001110 |
3 | 11000022112222012001020011 |
4 | 100133031333100220032 |
5 | 122030422232430220 |
6 | 2224301410343434 |
7 | 144600411512104 |
oct | 20371577205016 |
9 | 4008488161204 |
10 | 1133032311310 |
11 | 3a7575224429 |
12 | 16370a28ab7a |
13 | 82ac9458903 |
14 | 3cba6529c74 |
15 | 1e71590265a |
hex | 107cdfd0a0e |
1133032311310 has 8 divisors (see below), whose sum is σ = 2039458160376. Its totient is φ = 453212924520.
The previous prime is 1133032311293. The next prime is 1133032311413. The reversal of 1133032311310 is 131132303311.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11330323113102 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 56651615556 + ... + 56651615575.
It is an arithmetic number, because the mean of its divisors is an integer number (254932270047).
Almost surely, 21133032311310 is an apocalyptic number.
1133032311310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1133032311310 is a deficient number, since it is larger than the sum of its proper divisors (906425849066).
1133032311310 is a wasteful number, since it uses less digits than its factorization.
1133032311310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113303231138.
The product of its (nonzero) digits is 486, while the sum is 22.
Adding to 1133032311310 its reverse (131132303311), we get a palindrome (1264164614621).
The spelling of 1133032311310 in words is "one trillion, one hundred thirty-three billion, thirty-two million, three hundred eleven thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •