Base | Representation |
---|---|
bin | 1001001100101010111110… |
… | …1011001000001010100110 |
3 | 1022210211012021210112021020 |
4 | 2103022233223020022212 |
5 | 2311144014341130342 |
6 | 33301552552232010 |
7 | 2062443003315432 |
oct | 223125753101246 |
9 | 38724167715236 |
10 | 10113300333222 |
11 | 324a032426349 |
12 | 117403799b606 |
13 | 5848ac323308 |
14 | 26d6b47779c2 |
15 | 12810bb570ec |
hex | 932afac82a6 |
10113300333222 has 8 divisors (see below), whose sum is σ = 20226600666456. Its totient is φ = 3371100111072.
The previous prime is 10113300333139. The next prime is 10113300333223. The reversal of 10113300333222 is 22233300331101.
It is a sphenic number, since it is the product of 3 distinct primes.
10113300333222 is an admirable number.
It is a junction number, because it is equal to n+sod(n) for n = 10113300333192 and 10113300333201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10113300333223) 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, 842775027763 + ... + 842775027774.
It is an arithmetic number, because the mean of its divisors is an integer number (2528325083307).
Almost surely, 210113300333222 is an apocalyptic number.
10113300333222 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10113300333222 is a wasteful number, since it uses less digits than its factorization.
10113300333222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1685550055542.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 10113300333222 its reverse (22233300331101), we get a palindrome (32346600664323).
The spelling of 10113300333222 in words is "ten trillion, one hundred thirteen billion, three hundred million, three hundred thirty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •