Base | Representation |
---|---|
bin | 1011000001000101010011… |
… | …0010001000100001111000 |
3 | 1120220000100211200101122200 |
4 | 2300101110302020201320 |
5 | 3041430343412444000 |
6 | 41432424030150200 |
7 | 2360103064605303 |
oct | 260212462104170 |
9 | 46800324611580 |
10 | 12113230203000 |
11 | 3950212727273 |
12 | 1437760352360 |
13 | 69b3711a17c4 |
14 | 2dc3d7badb3a |
15 | 16015d8d0500 |
hex | b0454c88878 |
12113230203000 has 192 divisors, whose sum is σ = 41217505992000. Its totient is φ = 3208515206400.
The previous prime is 12113230202999. The next prime is 12113230203101. The reversal of 12113230203000 is 30203231121.
12113230203000 is a `hidden beast` number, since 1 + 2 + 113 + 230 + 20 + 300 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3175492 + ... + 5857491.
It is an arithmetic number, because the mean of its divisors is an integer number (214674510375).
Almost surely, 212113230203000 is an apocalyptic number.
12113230203000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12113230203000 is an abundant number, since it is smaller than the sum of its proper divisors (29104275789000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12113230203000 is a wasteful number, since it uses less digits than its factorization.
12113230203000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9033159 (or 9033142 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 12113230203000 its reverse (30203231121), we get a palindrome (12143433434121).
The spelling of 12113230203000 in words is "twelve trillion, one hundred thirteen billion, two hundred thirty million, two hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •