Base | Representation |
---|---|
bin | 10110111111010111001001… |
… | …001010111011100100101000 |
3 | 111021000010200101112110101201 |
4 | 112333113021022323210220 |
5 | 101223101214222413000 |
6 | 555013502155253544 |
7 | 30204020541045103 |
oct | 2677271112734450 |
9 | 437003611473351 |
10 | 101111200201000 |
11 | 2a243023605a30 |
12 | b41004044a2b4 |
13 | 445598c473492 |
14 | 1ad7b459c173a |
15 | ba52036a896a |
hex | 5bf5c92bb928 |
101111200201000 has 64 divisors (see below), whose sum is σ = 258109318359360. Its totient is φ = 36767709160000.
The previous prime is 101111200200973. The next prime is 101111200201007. The reversal of 101111200201000 is 102002111101.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (101111200201007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4595952646 + ... + 4595974645.
It is an arithmetic number, because the mean of its divisors is an integer number (4032958099365).
Almost surely, 2101111200201000 is an apocalyptic number.
101111200201000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101111200201000 is an abundant number, since it is smaller than the sum of its proper divisors (156998118158360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101111200201000 is a wasteful number, since it uses less digits than its factorization.
101111200201000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9191927323 (or 9191927309 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101111200201000 its reverse (102002111101), we get a palindrome (101213202312101).
The spelling of 101111200201000 in words is "one hundred one trillion, one hundred eleven billion, two hundred million, two hundred one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •