Base | Representation |
---|---|
bin | 10110111111101011100011… |
… | …010001101000100011111010 |
3 | 111021002020020112100002122121 |
4 | 112333223203101220203322 |
5 | 101223431103412032414 |
6 | 555031524414511454 |
7 | 30205424550556015 |
oct | 2677534321504372 |
9 | 437066215302577 |
10 | 101133113002234 |
11 | 2a251348833915 |
12 | b414336b0558a |
13 | 4457a72214561 |
14 | 1ad8c23d4437c |
15 | ba5a87310724 |
hex | 5bfae34688fa |
101133113002234 has 4 divisors (see below), whose sum is σ = 151699669503354. Its totient is φ = 50566556501116.
The previous prime is 101133113002133. The next prime is 101133113002237. The reversal of 101133113002234 is 432200311331101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in only one way, i.e., 98881087546609 + 2252025455625 = 9943897^2 + 1500675^2 .
It is a super-3 number, since 3×1011331130022343 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101133113002199 and 101133113002208.
It is not an unprimeable number, because it can be changed into a prime (101133113002237) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25283278250557 + ... + 25283278250560.
Almost surely, 2101133113002234 is an apocalyptic number.
101133113002234 is a deficient number, since it is larger than the sum of its proper divisors (50566556501120).
101133113002234 is an equidigital number, since it uses as much as digits as its factorization.
101133113002234 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50566556501119.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 101133113002234 its reverse (432200311331101), we get a palindrome (533333424333335).
The spelling of 101133113002234 in words is "one hundred one trillion, one hundred thirty-three billion, one hundred thirteen million, two thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •