Base | Representation |
---|---|
bin | 10110111111010111111110… |
… | …110111001101010000001000 |
3 | 111021000020000011112210121001 |
4 | 112333113332313031100020 |
5 | 101223110040324001300 |
6 | 555014131414424344 |
7 | 30204052056522613 |
oct | 2677277667152010 |
9 | 437006004483531 |
10 | 101112101000200 |
11 | 2a243446033784 |
12 | b4102520620b4 |
13 | 4455aa3c89864 |
14 | 1ad7bcd4a917a |
15 | ba52577e216a |
hex | 5bf5fedcd408 |
101112101000200 has 24 divisors (see below), whose sum is σ = 235085634825930. Its totient is φ = 40444840400000.
The previous prime is 101112101000171. The next prime is 101112101000221. The reversal of 101112101000200 is 2000101211101.
It can be written as a sum of positive squares in 3 ways, for example, as 70767228730276 + 30344872269924 = 8412326^2 + 5508618^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 252780252301 + ... + 252780252700.
Almost surely, 2101112101000200 is an apocalyptic number.
101112101000200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101112101000200 is an abundant number, since it is smaller than the sum of its proper divisors (133973533825730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101112101000200 is a wasteful number, since it uses less digits than its factorization.
101112101000200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 505560505017 (or 505560505008 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101112101000200 its reverse (2000101211101), we get a palindrome (103112202211301).
The spelling of 101112101000200 in words is "one hundred one trillion, one hundred twelve billion, one hundred one million, two hundred", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •