Base | Representation |
---|---|
bin | 10111000010100011001110… |
… | …011100110101010101101001 |
3 | 111021210002022001212221020001 |
4 | 113002203032130311111221 |
5 | 101240144010010042413 |
6 | 555302302324503001 |
7 | 30225606043416010 |
oct | 2702431634652551 |
9 | 437702261787201 |
10 | 101330332112233 |
11 | 2a317a5288a214 |
12 | b4465b724aa61 |
13 | 4470542367793 |
14 | 1b045b2977a77 |
15 | baac7b5724dd |
hex | 5c28ce735569 |
101330332112233 has 8 divisors (see below), whose sum is σ = 115811015457600. Its totient is φ = 86850879170640.
The previous prime is 101330332112203. The next prime is 101330332112239. The reversal of 101330332112233 is 332211233033101.
It is a happy number.
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 101330332112233 - 29 = 101330332111721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101330332112239) 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, 307424458 + ... + 307753891.
It is an arithmetic number, because the mean of its divisors is an integer number (14476376932200).
Almost surely, 2101330332112233 is an apocalyptic number.
It is an amenable number.
101330332112233 is a deficient number, since it is larger than the sum of its proper divisors (14480683345367).
101330332112233 is an equidigital number, since it uses as much as digits as its factorization.
101330332112233 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 615201887.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 101330332112233 its reverse (332211233033101), we get a palindrome (433541565145334).
The spelling of 101330332112233 in words is "one hundred one trillion, three hundred thirty billion, three hundred thirty-two million, one hundred twelve thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •