Base | Representation |
---|---|
bin | 10100100011010111… |
… | …10101010000110110 |
3 | 1001110222122102211011 |
4 | 22101223311100312 |
5 | 140044213340040 |
6 | 5022523302434 |
7 | 540302324524 |
oct | 122153652066 |
9 | 31428572734 |
10 | 11034121270 |
11 | 4752523697 |
12 | 217b37aa1a |
13 | 106b013453 |
14 | 769633314 |
15 | 448a7e3ea |
hex | 291af5436 |
11034121270 has 8 divisors (see below), whose sum is σ = 19861418304. Its totient is φ = 4413648504.
The previous prime is 11034121243. The next prime is 11034121271. The reversal of 11034121270 is 7212143011.
It is a happy number.
11034121270 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11034121271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 551706054 + ... + 551706073.
It is an arithmetic number, because the mean of its divisors is an integer number (2482677288).
Almost surely, 211034121270 is an apocalyptic number.
11034121270 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11034121270 is a deficient number, since it is larger than the sum of its proper divisors (8827297034).
11034121270 is a wasteful number, since it uses less digits than its factorization.
11034121270 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1103412134.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 11034121270 its reverse (7212143011), we get a palindrome (18246264281).
The spelling of 11034121270 in words is "eleven billion, thirty-four million, one hundred twenty-one thousand, two hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •