Base | Representation |
---|---|
bin | 100010000000111… |
… | …1000010011011010 |
3 | 2221112122020212122 |
4 | 1010001320103122 |
5 | 4314140442300 |
6 | 305130541242 |
7 | 40166154632 |
oct | 10401702332 |
9 | 2845566778 |
10 | 1141343450 |
11 | 536293255 |
12 | 27a297822 |
13 | 1525c7b70 |
14 | ab8216c2 |
15 | 6a300c85 |
hex | 440784da |
1141343450 has 48 divisors (see below), whose sum is σ = 2420704440. Its totient is φ = 396625920.
The previous prime is 1141343449. The next prime is 1141343479. The reversal of 1141343450 is 543431411.
It is a happy number.
1141343450 is digitally balanced in base 6, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 13256881 + 1128086569 = 3641^2 + 33587^2 .
It is a Harshad number since it is a multiple of its sum of digits (26).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40595 + ... + 62694.
Almost surely, 21141343450 is an apocalyptic number.
1141343450 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1141343450 is an abundant number, since it is smaller than the sum of its proper divisors (1279360990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1141343450 is a wasteful number, since it uses less digits than its factorization.
1141343450 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 103331 (or 103326 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 26.
The square root of 1141343450 is about 33783.7749518907. The cubic root of 1141343450 is about 1045.0541244678.
Adding to 1141343450 its reverse (543431411), we get a palindrome (1684774861).
The spelling of 1141343450 in words is "one billion, one hundred forty-one million, three hundred forty-three thousand, four hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •