Base | Representation |
---|---|
bin | 10110110010000110101110… |
… | …100101001001011100111100 |
3 | 111010210001021200111021222120 |
4 | 112302012232211021130330 |
5 | 101113140023040201022 |
6 | 553035202430042540 |
7 | 30051140612560266 |
oct | 2662065645113474 |
9 | 433701250437876 |
10 | 100200221022012 |
11 | 29a217476094a1 |
12 | b2a3583349450 |
13 | 43baac019ca77 |
14 | 1aa5a063c8b36 |
15 | b8b687351d5c |
hex | 5b21ae94973c |
100200221022012 has 48 divisors (see below), whose sum is σ = 240335968645920. Its totient is φ = 32468065512192.
The previous prime is 100200221022007. The next prime is 100200221022059. The reversal of 100200221022012 is 210220122002001.
It is a junction number, because it is equal to n+sod(n) for n = 100200221021982 and 100200221022000.
It is a congruent number.
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, 101255203 + ... + 102239994.
It is an arithmetic number, because the mean of its divisors is an integer number (5006999346790).
Almost surely, 2100200221022012 is an apocalyptic number.
100200221022012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
100200221022012 is an abundant number, since it is smaller than the sum of its proper divisors (140135747623908).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100200221022012 is a wasteful number, since it uses less digits than its factorization.
100200221022012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 203496350 (or 203496348 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 100200221022012 its reverse (210220122002001), we get a palindrome (310420343024013).
The spelling of 100200221022012 in words is "one hundred trillion, two hundred billion, two hundred twenty-one million, twenty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •