Base | Representation |
---|---|
bin | 10110111111001100101101… |
… | …101110010101100001010001 |
3 | 111020222001202222201020210221 |
4 | 112333030231232111201101 |
5 | 101222410301042131113 |
6 | 555004411101353041 |
7 | 30203143206345250 |
oct | 2677145556254121 |
9 | 436861688636727 |
10 | 101100002302033 |
11 | 2a2392a769a779 |
12 | b409a36268781 |
13 | 44548c6548c67 |
14 | 1ad73a2718797 |
15 | ba4c9a57798d |
hex | 5bf32db95851 |
101100002302033 has 8 divisors (see below), whose sum is σ = 115657372031360. Its totient is φ = 86571260637120.
The previous prime is 101100002301979. The next prime is 101100002302051. The reversal of 101100002302033 is 330203200001101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101100002302033 - 229 = 101099465431121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101100002301998 and 101100002302016.
It is not an unprimeable number, because it can be changed into a prime (101100002302063) 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, 7157008533 + ... + 7157022658.
It is an arithmetic number, because the mean of its divisors is an integer number (14457171503920).
Almost surely, 2101100002302033 is an apocalyptic number.
It is an amenable number.
101100002302033 is a deficient number, since it is larger than the sum of its proper divisors (14557369729327).
101100002302033 is a wasteful number, since it uses less digits than its factorization.
101100002302033 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14314032207.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 101100002302033 its reverse (330203200001101), we get a palindrome (431303202303134).
The spelling of 101100002302033 in words is "one hundred one trillion, one hundred billion, two million, three hundred two thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •