Base | Representation |
---|---|
bin | 100000110100110… |
… | …0101110111000111 |
3 | 2211202112000222021 |
4 | 1001221211313013 |
5 | 4223431001043 |
6 | 301143144011 |
7 | 36202634632 |
oct | 10151456707 |
9 | 2752460867 |
10 | 1101422023 |
11 | 5157a6739 |
12 | 268a45007 |
13 | 14725b010 |
14 | a63ccc19 |
15 | 66a673ed |
hex | 41a65dc7 |
1101422023 has 8 divisors (see below), whose sum is σ = 1186441088. Its totient is φ = 1016445024.
The previous prime is 1101422011. The next prime is 1101422041. The reversal of 1101422023 is 3202241011.
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 1101422023 - 217 = 1101290951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1101421988 and 1101422006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1101422053) 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, 62890 + ... + 78472.
It is an arithmetic number, because the mean of its divisors is an integer number (148305136).
Almost surely, 21101422023 is an apocalyptic number.
1101422023 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1101422023 is a deficient number, since it is larger than the sum of its proper divisors (85019065).
1101422023 is a wasteful number, since it uses less digits than its factorization.
1101422023 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21033.
The product of its (nonzero) digits is 96, while the sum is 16.
The square root of 1101422023 is about 33187.6787829459. The cubic root of 1101422023 is about 1032.7247499920.
Adding to 1101422023 its reverse (3202241011), we get a palindrome (4303663034).
The spelling of 1101422023 in words is "one billion, one hundred one million, four hundred twenty-two thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •