Base | Representation |
---|---|
bin | 1011000111111000101101… |
… | …1011011101011000111000 |
3 | 1121022012001110202022202122 |
4 | 2301332023123131120320 |
5 | 3100334231421414000 |
6 | 42002234022020412 |
7 | 2401411361205101 |
oct | 261761333353070 |
9 | 47265043668678 |
10 | 12230111123000 |
11 | 3995840988421 |
12 | 145633b577708 |
13 | 6a93aa1103b4 |
14 | 303d24b933a8 |
15 | 1631eeb1e085 |
hex | b1f8b6dd638 |
12230111123000 has 32 divisors (see below), whose sum is σ = 28618460030160. Its totient is φ = 4892044448800.
The previous prime is 12230111122939. The next prime is 12230111123017. The reversal of 12230111123000 is 32111103221.
It is a super-2 number, since 2×122301111230002 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 12230111123000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6115054562 + ... + 6115056561.
Almost surely, 212230111123000 is an apocalyptic number.
12230111123000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12230111123000 is an abundant number, since it is smaller than the sum of its proper divisors (16388348907160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12230111123000 is a wasteful number, since it uses less digits than its factorization.
12230111123000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12230111144 (or 12230111130 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 12230111123000 its reverse (32111103221), we get a palindrome (12262222226221).
The spelling of 12230111123000 in words is "twelve trillion, two hundred thirty billion, one hundred eleven million, one hundred twenty-three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •