Base | Representation |
---|---|
bin | 101111000101101001… |
… | …0111000100111100011 |
3 | 100200000022102210111001 |
4 | 1132023102320213203 |
5 | 3124044013400311 |
6 | 114242054532431 |
7 | 10206610166341 |
oct | 1361322704743 |
9 | 320008383431 |
10 | 101121231331 |
11 | 3998133186a |
12 | 17721367117 |
13 | 96c6bb5133 |
14 | 4c73d28991 |
15 | 296c8b64c1 |
hex | 178b4b89e3 |
101121231331 has 8 divisors (see below), whose sum is σ = 102578092560. Its totient is φ = 99666306432.
The previous prime is 101121231251. The next prime is 101121231383. The reversal of 101121231331 is 133132121101.
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 101121231331 - 229 = 100584360419 is a prime.
It is a super-2 number, since 2×1011212313312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 101121231299 and 101121231308.
It is not an unprimeable number, because it can be changed into a prime (101121231391) 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, 378721 + ... + 587938.
It is an arithmetic number, because the mean of its divisors is an integer number (12822261570).
Almost surely, 2101121231331 is an apocalyptic number.
101121231331 is a deficient number, since it is larger than the sum of its proper divisors (1456861229).
101121231331 is an equidigital number, since it uses as much as digits as its factorization.
101121231331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 968165.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 101121231331 its reverse (133132121101), we get a palindrome (234253352432).
The spelling of 101121231331 in words is "one hundred one billion, one hundred twenty-one million, two hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •