Base | Representation |
---|---|
bin | 1010000010010001011001… |
… | …0000011110101010111110 |
3 | 1110001212001111101000120222 |
4 | 2200210112100132222332 |
5 | 2421240411431331420 |
6 | 35245003240341342 |
7 | 2216122245622214 |
oct | 240442620365276 |
9 | 43055044330528 |
10 | 11034144402110 |
11 | 3574610945655 |
12 | 12a25a8774852 |
13 | 6206912c979b |
14 | 2a20ac1a2cb4 |
15 | 14205407e225 |
hex | a091641eabe |
11034144402110 has 8 divisors (see below), whose sum is σ = 19861459923816. Its totient is φ = 4413657760840.
The previous prime is 11034144402109. The next prime is 11034144402119. The reversal of 11034144402110 is 1120444143011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 11034144402110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11034144402119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551707220096 + ... + 551707220115.
It is an arithmetic number, because the mean of its divisors is an integer number (2482682490477).
Almost surely, 211034144402110 is an apocalyptic number.
11034144402110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11034144402110 is a deficient number, since it is larger than the sum of its proper divisors (8827315521706).
11034144402110 is a wasteful number, since it uses less digits than its factorization.
11034144402110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1103414440218.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 11034144402110 its reverse (1120444143011), we get a palindrome (12154588545121).
The spelling of 11034144402110 in words is "eleven trillion, thirty-four billion, one hundred forty-four million, four hundred two thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •