Base | Representation |
---|---|
bin | 10111000010100011000001… |
… | …110111101000010100101001 |
3 | 111021210001202100200222221201 |
4 | 113002203001313220110221 |
5 | 101240143041441024001 |
6 | 555302225344404201 |
7 | 30225600601315450 |
oct | 2702430167502451 |
9 | 437701670628851 |
10 | 101330121033001 |
11 | 2a31795471a273 |
12 | b446558616661 |
13 | 447050a701623 |
14 | 1b0459290db97 |
15 | baac67c7a501 |
hex | 5c28c1de8529 |
101330121033001 has 8 divisors (see below), whose sum is σ = 116171170758720. Its totient is φ = 86580400844688.
The previous prime is 101330121032989. The next prime is 101330121033149. The reversal of 101330121033001 is 100330121033101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 101330121033001 - 217 = 101330120901929 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101330121033001.
It is not an unprimeable number, because it can be changed into a prime (101330121033301) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 22832381971 + ... + 22832386408.
It is an arithmetic number, because the mean of its divisors is an integer number (14521396344840).
Almost surely, 2101330121033001 is an apocalyptic number.
It is an amenable number.
101330121033001 is a deficient number, since it is larger than the sum of its proper divisors (14841049725719).
101330121033001 is an equidigital number, since it uses as much as digits as its factorization.
101330121033001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45664768703.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 101330121033001 its reverse (100330121033101), we get a palindrome (201660242066102).
The spelling of 101330121033001 in words is "one hundred one trillion, three hundred thirty billion, one hundred twenty-one million, thirty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •