Base | Representation |
---|---|
bin | 1010000111011101101001… |
… | …0011111111000000001110 |
3 | 1110101101021012110021221212 |
4 | 2201313122103333000032 |
5 | 2424221041222014410 |
6 | 35353553313454422 |
7 | 2225430363326432 |
oct | 241673223770016 |
9 | 43341235407855 |
10 | 11123333001230 |
11 | 35a94195491aa |
12 | 12b7939871412 |
13 | 628c05ca67a8 |
14 | 2a652d4089c2 |
15 | 144524080b05 |
hex | a1dda4ff00e |
11123333001230 has 8 divisors (see below), whose sum is σ = 20021999402232. Its totient is φ = 4449333200488.
The previous prime is 11123333001229. The next prime is 11123333001251. The reversal of 11123333001230 is 3210033332111.
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 = 11123333001196 and 11123333001205.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 556166650052 + ... + 556166650071.
It is an arithmetic number, because the mean of its divisors is an integer number (2502749925279).
Almost surely, 211123333001230 is an apocalyptic number.
11123333001230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11123333001230 is a deficient number, since it is larger than the sum of its proper divisors (8898666401002).
11123333001230 is a wasteful number, since it uses less digits than its factorization.
11123333001230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1112333300130.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 11123333001230 its reverse (3210033332111), we get a palindrome (14333366333341).
The spelling of 11123333001230 in words is "eleven trillion, one hundred twenty-three billion, three hundred thirty-three million, one thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.230 sec. • engine limits •