Base | Representation |
---|---|
bin | 100000110100110… |
… | …1000000101010011 |
3 | 2211202112111110022 |
4 | 1001221220011103 |
5 | 4223431243443 |
6 | 301143254055 |
7 | 36203003312 |
oct | 10151500523 |
9 | 2752474408 |
10 | 1101431123 |
11 | 515802561 |
12 | 268a4a32b |
13 | 1472621c0 |
14 | a63d2279 |
15 | 66a69e68 |
hex | 41a68153 |
1101431123 has 8 divisors (see below), whose sum is σ = 1187099088. Its totient is φ = 1015897824.
The previous prime is 1101431099. The next prime is 1101431129. The reversal of 1101431123 is 3211341011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1101431123 is a prime.
It is a super-2 number, since 2×11014311232 = 2426301037426082258, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1101431129) 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, 16340 + ... + 49697.
It is an arithmetic number, because the mean of its divisors is an integer number (148387386).
Almost surely, 21101431123 is an apocalyptic number.
1101431123 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1101431123 is a deficient number, since it is larger than the sum of its proper divisors (85667965).
1101431123 is a wasteful number, since it uses less digits than its factorization.
1101431123 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67333.
The product of its (nonzero) digits is 72, while the sum is 17.
The square root of 1101431123 is about 33187.8158817359. The cubic root of 1101431123 is about 1032.7275941242.
Adding to 1101431123 its reverse (3211341011), we get a palindrome (4312772134).
The spelling of 1101431123 in words is "one billion, one hundred one million, four hundred thirty-one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •