Base | Representation |
---|---|
bin | 10110110010001000011110… |
… | …100101101001011000101000 |
3 | 111010210020010122111110221100 |
4 | 112302020132211221120220 |
5 | 101113202400122413000 |
6 | 553040113115241400 |
7 | 30051235311411240 |
oct | 2662103645513050 |
9 | 433706118443840 |
10 | 100202100201000 |
11 | 29a22521333486 |
12 | b2a3a08749260 |
13 | 43bb02c5c35b5 |
14 | 1aa5b43bd2b20 |
15 | b8b7472eaa00 |
hex | 5b221e969628 |
100202100201000 has 192 divisors, whose sum is σ = 387066398734080. Its totient is φ = 22903337174400.
The previous prime is 100202100200911. The next prime is 100202100201067. The reversal of 100202100201000 is 102001202001.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 795191764 + ... + 795317763.
It is an arithmetic number, because the mean of its divisors is an integer number (2015970826740).
Almost surely, 2100202100201000 is an apocalyptic number.
100202100201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100202100201000 is an abundant number, since it is smaller than the sum of its proper divisors (286864298533080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100202100201000 is a wasteful number, since it uses less digits than its factorization.
100202100201000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1590509561 (or 1590509544 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 100202100201000 its reverse (102001202001), we get a palindrome (100304101403001).
The spelling of 100202100201000 in words is "one hundred trillion, two hundred two billion, one hundred million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •