Base | Representation |
---|---|
bin | 10110111110001011110101… |
… | …000100011010011010111111 |
3 | 111020201101221120100000110020 |
4 | 112332023311010122122333 |
5 | 101220240110032424411 |
6 | 554512405515543223 |
7 | 30165125550242451 |
oct | 2676136504323277 |
9 | 436641846300406 |
10 | 101030332311231 |
11 | 2a2117a5809484 |
12 | b3b8431a5ab13 |
13 | 444b1725a862b |
14 | 1ad3c738882d1 |
15 | ba306de02606 |
hex | 5be2f511a6bf |
101030332311231 has 8 divisors (see below), whose sum is σ = 134707470769920. Its totient is φ = 67353374363352.
The previous prime is 101030332311217. The next prime is 101030332311257. The reversal of 101030332311231 is 132113233030101.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101030332311231 - 217 = 101030332180159 is a prime.
It is a super-2 number, since 2×1010303323112312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101030332316231) 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, 43816311 + ... + 46064408.
It is an arithmetic number, because the mean of its divisors is an integer number (16838433846240).
Almost surely, 2101030332311231 is an apocalyptic number.
101030332311231 is a deficient number, since it is larger than the sum of its proper divisors (33677138458689).
101030332311231 is an equidigital number, since it uses as much as digits as its factorization.
101030332311231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 90255405.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 101030332311231 its reverse (132113233030101), we get a palindrome (233143565341332).
The spelling of 101030332311231 in words is "one hundred one trillion, thirty billion, three hundred thirty-two million, three hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •