Base | Representation |
---|---|
bin | 10110110010011100000010… |
… | …100001010010000010000000 |
3 | 111010212020100110002200112002 |
4 | 112302130002201102002000 |
5 | 101114023404124144300 |
6 | 553053505230323132 |
7 | 30052610644025321 |
oct | 2662340241220200 |
9 | 433766313080462 |
10 | 100223104131200 |
11 | 29a3041a520086 |
12 | b2a7aaa9594a8 |
13 | 43bccc8c8326b |
14 | 1aa6b7756a448 |
15 | b8c0762725d5 |
hex | 5b2702852080 |
100223104131200 has 96 divisors (see below), whose sum is σ = 262146056885460. Its totient is φ = 37731050946560.
The previous prime is 100223104131053. The next prime is 100223104131221. The reversal of 100223104131200 is 2131401322001.
It can be written as a sum of positive squares in 6 ways, for example, as 55843098534976 + 44380005596224 = 7472824^2 + 6661832^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 921113837 + ... + 921222636.
Almost surely, 2100223104131200 is an apocalyptic number.
100223104131200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100223104131200 is an abundant number, since it is smaller than the sum of its proper divisors (161922952754260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100223104131200 is a wasteful number, since it uses less digits than its factorization.
100223104131200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1842336514 (or 1842336497 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 100223104131200 its reverse (2131401322001), we get a palindrome (102354505453201).
The spelling of 100223104131200 in words is "one hundred trillion, two hundred twenty-three billion, one hundred four million, one hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •