Base | Representation |
---|---|
bin | 11110010011010010110… |
… | …00110111100010001000 |
3 | 10200112101112210210112120 |
4 | 33021221120313202020 |
5 | 114024233423242412 |
6 | 2114144154211240 |
7 | 135135446533164 |
oct | 17115130674210 |
9 | 3615345723476 |
10 | 1041150212232 |
11 | 371605174459 |
12 | 149947123b20 |
13 | 7724572c950 |
14 | 3856b6a3ca4 |
15 | 1c139201b8c |
hex | f269637888 |
1041150212232 has 64 divisors (see below), whose sum is σ = 2804665080000. Its totient is φ = 320174671104.
The previous prime is 1041150212183. The next prime is 1041150212251. The reversal of 1041150212232 is 2322120511401.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 374482 + ... + 1490817.
It is an arithmetic number, because the mean of its divisors is an integer number (43822891875).
Almost surely, 21041150212232 is an apocalyptic number.
1041150212232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1041150212232 is an abundant number, since it is smaller than the sum of its proper divisors (1763514867768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1041150212232 is a wasteful number, since it uses less digits than its factorization.
1041150212232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1867110 (or 1867106 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 1041150212232 its reverse (2322120511401), we get a palindrome (3363270723633).
The spelling of 1041150212232 in words is "one trillion, forty-one billion, one hundred fifty million, two hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •