Base | Representation |
---|---|
bin | 101110101011000111… |
… | …1011000110101111101 |
3 | 100120201021112120102221 |
4 | 1131112033120311331 |
5 | 3120233131403201 |
6 | 114013500445341 |
7 | 10145551324312 |
oct | 1352617306575 |
9 | 316637476387 |
10 | 100231122301 |
11 | 39564945772 |
12 | 17513249851 |
13 | 95b46727bb |
14 | 4bcba24d09 |
15 | 29196904a1 |
hex | 17563d8d7d |
100231122301 has 4 divisors (see below), whose sum is σ = 100996245504. Its totient is φ = 99465999100.
The previous prime is 100231122259. The next prime is 100231122347. The reversal of 100231122301 is 103221132001.
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 a de Polignac number, because none of the positive numbers 2k-100231122301 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100232122301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 382561405 + ... + 382561666.
It is an arithmetic number, because the mean of its divisors is an integer number (25249061376).
Almost surely, 2100231122301 is an apocalyptic number.
It is an amenable number.
100231122301 is a deficient number, since it is larger than the sum of its proper divisors (765123203).
100231122301 is an equidigital number, since it uses as much as digits as its factorization.
100231122301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 765123202.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 100231122301 its reverse (103221132001), we get a palindrome (203452254302).
The spelling of 100231122301 in words is "one hundred billion, two hundred thirty-one million, one hundred twenty-two thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •