Base | Representation |
---|---|
bin | 101111001011010101… |
… | …0111111111110110001 |
3 | 100200111121121001020222 |
4 | 1132112222333332301 |
5 | 3124441344233241 |
6 | 114313033542425 |
7 | 10214415442463 |
oct | 1362652777661 |
9 | 320447531228 |
10 | 101312102321 |
11 | 39a6a049a91 |
12 | 17775274a15 |
13 | 97275c4151 |
14 | 4c91412133 |
15 | 297e51aa4b |
hex | 1796abffb1 |
101312102321 has 4 divisors (see below), whose sum is σ = 101489532144. Its totient is φ = 101134672500.
The previous prime is 101312102317. The next prime is 101312102341. The reversal of 101312102321 is 123201213101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 101312102321 - 22 = 101312102317 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101312102321.
It is not an unprimeable number, because it can be changed into a prime (101312102341) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 88714055 + ... + 88715196.
It is an arithmetic number, because the mean of its divisors is an integer number (25372383036).
Almost surely, 2101312102321 is an apocalyptic number.
It is an amenable number.
101312102321 is a deficient number, since it is larger than the sum of its proper divisors (177429823).
101312102321 is an equidigital number, since it uses as much as digits as its factorization.
101312102321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177429822.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 101312102321 its reverse (123201213101), we get a palindrome (224513315422).
The spelling of 101312102321 in words is "one hundred one billion, three hundred twelve million, one hundred two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •