Base | Representation |
---|---|
bin | 101111001110101001… |
… | …1010011011100011111 |
3 | 100200210100220001110111 |
4 | 1132131103103130133 |
5 | 3130203333043403 |
6 | 114332045550451 |
7 | 10220236042603 |
oct | 1363523233437 |
9 | 320710801414 |
10 | 101423331103 |
11 | 3a01690a8a6 |
12 | 177a6575427 |
13 | 97446698b3 |
14 | 4ca20c7503 |
15 | 298918c56d |
hex | 179d4d371f |
101423331103 has 8 divisors (see below), whose sum is σ = 103910730336. Its totient is φ = 98936582400.
The previous prime is 101423331101. The next prime is 101423331131. The reversal of 101423331103 is 301133324101.
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 101423331103 - 21 = 101423331101 is a prime.
It is a super-3 number, since 3×1014233311033 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101423331101) 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 7 ways as a sum of consecutive naturals, for example, 160798 + ... + 478228.
It is an arithmetic number, because the mean of its divisors is an integer number (12988841292).
Almost surely, 2101423331103 is an apocalyptic number.
101423331103 is a deficient number, since it is larger than the sum of its proper divisors (2487399233).
101423331103 is an equidigital number, since it uses as much as digits as its factorization.
101423331103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 325265.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 101423331103 its reverse (301133324101), we get a palindrome (402556655204).
The spelling of 101423331103 in words is "one hundred one billion, four hundred twenty-three million, three hundred thirty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •