Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …001010100001111011101000 |
3 | 111021100120200222220020010001 |
4 | 113000303022022201323220 |
5 | 101231211040241333000 |
6 | 555131122130032344 |
7 | 30214116115026412 |
oct | 2700631212417350 |
9 | 437316628806101 |
10 | 101210001121000 |
11 | 2a280a14103522 |
12 | b4272147186b4 |
13 | 44620a6721415 |
14 | 1adc8396b19b2 |
15 | ba7a874da46a |
hex | 5c0cca2a1ee8 |
101210001121000 has 32 divisors (see below), whose sum is σ = 236831402625480. Its totient is φ = 40484000448000.
The previous prime is 101210001120989. The next prime is 101210001121081. The reversal of 101210001121000 is 121100012101.
It can be written as a sum of positive squares in 4 ways, for example, as 61303920221124 + 39906080899876 = 7829682^2 + 6317126^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 7 ways as a sum of consecutive naturals, for example, 50604999561 + ... + 50605001560.
Almost surely, 2101210001121000 is an apocalyptic number.
101210001121000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101210001121000 is an abundant number, since it is smaller than the sum of its proper divisors (135621401504480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101210001121000 is a wasteful number, since it uses less digits than its factorization.
101210001121000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101210001142 (or 101210001128 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 101210001121000 its reverse (121100012101), we get a palindrome (101331101133101).
The spelling of 101210001121000 in words is "one hundred one trillion, two hundred ten billion, one million, one hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •