Base | Representation |
---|---|
bin | 1010111011001000011111… |
… | …1111110011100100110100 |
3 | 1120112020111221201201122201 |
4 | 2232302013333303210310 |
5 | 3033242022103210400 |
6 | 41313440521034244 |
7 | 2346524013161266 |
oct | 256620777634464 |
9 | 46466457651581 |
10 | 12011010210100 |
11 | 39109281566a0 |
12 | 141b993025984 |
13 | 6918307805c5 |
14 | 2d749bd89b36 |
15 | 15c67982a06a |
hex | aec87ff3934 |
12011010210100 has 72 divisors (see below), whose sum is σ = 28752812827200. Its totient is φ = 4318565433600.
The previous prime is 12011010210097. The next prime is 12011010210131. The reversal of 12011010210100 is 101201011021.
It is a super-2 number, since 2×120110102101002 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 61245360 + ... + 61441159.
It is an arithmetic number, because the mean of its divisors is an integer number (399344622600).
Almost surely, 212011010210100 is an apocalyptic number.
12011010210100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12011010210100 is an abundant number, since it is smaller than the sum of its proper divisors (16741802617100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12011010210100 is a wasteful number, since it uses less digits than its factorization.
12011010210100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 122686633 (or 122686626 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 12011010210100 its reverse (101201011021), we get a palindrome (12112211221121).
The spelling of 12011010210100 in words is "twelve trillion, eleven billion, ten million, two hundred ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •