Base | Representation |
---|---|
bin | 10110111110001101100101… |
… | …101010011010101100110001 |
3 | 111020201120211012211201010021 |
4 | 112332031211222122230301 |
5 | 101220302442124301113 |
6 | 554513321200003441 |
7 | 30165223425462541 |
oct | 2676154552325461 |
9 | 436646735751107 |
10 | 101032221322033 |
11 | 2a212585039231 |
12 | b3b887a600581 |
13 | 444b3b3a622c1 |
14 | 1ad3db26d1321 |
15 | ba312eb8e48d |
hex | 5be365a9ab31 |
101032221322033 has 8 divisors (see below), whose sum is σ = 105425449416000. Its totient is φ = 96639036796368.
The previous prime is 101032221322013. The next prime is 101032221322103. The reversal of 101032221322033 is 330223122230101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101032221322033 - 241 = 98833198066481 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 101032221321989 and 101032221322007.
It is not an unprimeable number, because it can be changed into a prime (101032221322013) 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, 6108663 + ... + 15471916.
It is an arithmetic number, because the mean of its divisors is an integer number (13178181177000).
Almost surely, 2101032221322033 is an apocalyptic number.
It is an amenable number.
101032221322033 is a deficient number, since it is larger than the sum of its proper divisors (4393228093967).
101032221322033 is a wasteful number, since it uses less digits than its factorization.
101032221322033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21784151.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 101032221322033 its reverse (330223122230101), we get a palindrome (431255343552134).
The spelling of 101032221322033 in words is "one hundred one trillion, thirty-two billion, two hundred twenty-one million, three hundred twenty-two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •