Base | Representation |
---|---|
bin | 10110110000111100001110… |
… | …001101010010010100111101 |
3 | 111010111101210100100011012011 |
4 | 112300330032031102110331 |
5 | 101110332203034013041 |
6 | 552534332232011221 |
7 | 30042306260610424 |
oct | 2660741615222475 |
9 | 433441710304164 |
10 | 100120221001021 |
11 | 299a0824698671 |
12 | b28bb77530b11 |
13 | 43b33b105b540 |
14 | 1aa1bb76462bb |
15 | b89553d7be81 |
hex | 5b0f0e35253d |
100120221001021 has 32 divisors (see below), whose sum is σ = 111533072466816. Its totient is φ = 89284645632000.
The previous prime is 100120221000967. The next prime is 100120221001061. The reversal of 100120221001021 is 120100122021001.
It is not a de Polignac number, because 100120221001021 - 27 = 100120221000893 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 100120221000992 and 100120221001010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100120221001061) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31072101 + ... + 34142581.
It is an arithmetic number, because the mean of its divisors is an integer number (3485408514588).
Almost surely, 2100120221001021 is an apocalyptic number.
It is an amenable number.
100120221001021 is a deficient number, since it is larger than the sum of its proper divisors (11412851465795).
100120221001021 is a wasteful number, since it uses less digits than its factorization.
100120221001021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3071133.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 100120221001021 its reverse (120100122021001), we get a palindrome (220220343022022).
The spelling of 100120221001021 in words is "one hundred trillion, one hundred twenty billion, two hundred twenty-one million, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •