Base | Representation |
---|---|
bin | 100010000000011… |
… | …1111011011000010 |
3 | 2221112012102021121 |
4 | 1010000333123002 |
5 | 4314111013331 |
6 | 305121542454 |
7 | 40164164446 |
oct | 10400773302 |
9 | 2845172247 |
10 | 1141110466 |
11 | 536144201 |
12 | 27a1a4a2a |
13 | 152545ac2 |
14 | ab7a0826 |
15 | 6a2a6c11 |
hex | 4403f6c2 |
1141110466 has 8 divisors (see below), whose sum is σ = 1715752080. Its totient is φ = 569193108.
The previous prime is 1141110463. The next prime is 1141110491. The reversal of 1141110466 is 6640111411.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×11411104662 = 2604266191229474312, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1141110466.
It is not an unprimeable number, because it can be changed into a prime (1141110463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 680016 + ... + 681691.
It is an arithmetic number, because the mean of its divisors is an integer number (214469010).
Almost surely, 21141110466 is an apocalyptic number.
1141110466 is a deficient number, since it is larger than the sum of its proper divisors (574641614).
1141110466 is a wasteful number, since it uses less digits than its factorization.
1141110466 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1362128.
The product of its (nonzero) digits is 576, while the sum is 25.
The square root of 1141110466 is about 33780.3266118017. The cubic root of 1141110466 is about 1044.9830101860.
Adding to 1141110466 its reverse (6640111411), we get a palindrome (7781221877).
The spelling of 1141110466 in words is "one billion, one hundred forty-one million, one hundred ten thousand, four hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •