Base | Representation |
---|---|
bin | 1011001100101101100010… |
… | …1101001111111111111000 |
3 | 1121121010000222101202222220 |
4 | 2303023120231033333320 |
5 | 3103214022033323000 |
6 | 42104304123444040 |
7 | 2410404626136111 |
oct | 263133055177770 |
9 | 47533028352886 |
10 | 12313012011000 |
11 | 3a17a1230a5a8 |
12 | 146a416986620 |
13 | 6b415c23718c |
14 | 307d4acd5208 |
15 | 165452b051a0 |
hex | b32d8b4fff8 |
12313012011000 has 128 divisors (see below), whose sum is σ = 38419334553600. Its totient is φ = 3283235932800.
The previous prime is 12313012010993. The next prime is 12313012011019. The reversal of 12313012011000 is 11021031321.
It is a happy number.
It is a super-2 number, since 2×123130120110002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 44210181 + ... + 44487819.
It is an arithmetic number, because the mean of its divisors is an integer number (300151051200).
Almost surely, 212313012011000 is an apocalyptic number.
12313012011000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12313012011000 is an abundant number, since it is smaller than the sum of its proper divisors (26106322542600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12313012011000 is a wasteful number, since it uses less digits than its factorization.
12313012011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 292446 (or 292432 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 12313012011000 its reverse (11021031321), we get a palindrome (12324033042321).
The spelling of 12313012011000 in words is "twelve trillion, three hundred thirteen billion, twelve million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •