Base | Representation |
---|---|
bin | 10000001001111101001… |
… | …010011001101011111111 |
3 | 10221010121211212122222202 |
4 | 100021331022121223333 |
5 | 121142143032103043 |
6 | 2210004113502115 |
7 | 143131553355053 |
oct | 20117512315377 |
9 | 3833554778882 |
10 | 1110201441023 |
11 | 398919852694 |
12 | 15b1b827193b |
13 | 808cb4358cc |
14 | 3ba3c2a5c63 |
15 | 1dd2b3a01b8 |
hex | 1027d299aff |
1110201441023 has 8 divisors (see below), whose sum is σ = 1178160931728. Its totient is φ = 1042536786304.
The previous prime is 1110201440977. The next prime is 1110201441031. The reversal of 1110201441023 is 3201441020111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1110201441023 - 236 = 1041481964287 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1110201440986 and 1110201441004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1110201443023) 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, 73701236 + ... + 73716297.
It is an arithmetic number, because the mean of its divisors is an integer number (147270116466).
Almost surely, 21110201441023 is an apocalyptic number.
1110201441023 is a deficient number, since it is larger than the sum of its proper divisors (67959490705).
1110201441023 is a wasteful number, since it uses less digits than its factorization.
1110201441023 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 147417993.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 1110201441023 its reverse (3201441020111), we get a palindrome (4311642461134).
The spelling of 1110201441023 in words is "one trillion, one hundred ten billion, two hundred one million, four hundred forty-one thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •