Base | Representation |
---|---|
bin | 10110111111001100111010… |
… | …001110010100000011001100 |
3 | 111020222002022121022120201120 |
4 | 112333030322032110003030 |
5 | 101222411213233324322 |
6 | 555004443552240540 |
7 | 30203151334011261 |
oct | 2677147216240314 |
9 | 436862277276646 |
10 | 101100212011212 |
11 | 2a2393a5004347 |
12 | b409a94540150 |
13 | 445492ab2262b |
14 | 1ad73c2507268 |
15 | ba4cadb9da5c |
hex | 5bf33a3940cc |
101100212011212 has 48 divisors (see below), whose sum is σ = 244733857536000. Its totient is φ = 32449087313280.
The previous prime is 101100212011199. The next prime is 101100212011283. The reversal of 101100212011212 is 212110212001101.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 101100212011191 and 101100212011200.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 682777137 + ... + 682925192.
It is an arithmetic number, because the mean of its divisors is an integer number (5098622032000).
Almost surely, 2101100212011212 is an apocalyptic number.
101100212011212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101100212011212 is an abundant number, since it is smaller than the sum of its proper divisors (143633645524788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101100212011212 is a wasteful number, since it uses less digits than its factorization.
101100212011212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1365702566 (or 1365702564 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 101100212011212 its reverse (212110212001101), we get a palindrome (313210424012313).
The spelling of 101100212011212 in words is "one hundred one trillion, one hundred billion, two hundred twelve million, eleven thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •