Base | Representation |
---|---|
bin | 1001100110001110111000… |
… | …0010100111001110010100 |
3 | 1101100210200020000200110210 |
4 | 2121203232002213032110 |
5 | 2340342340413410312 |
6 | 34235415420445420 |
7 | 2136250064306211 |
oct | 231435602471624 |
9 | 41323606020423 |
10 | 10552433341332 |
11 | 33a9297579963 |
12 | 12251706a9870 |
13 | 5b712320674c |
14 | 286a51d00b08 |
15 | 13475dd7ae3c |
hex | 998ee0a7394 |
10552433341332 has 12 divisors (see below), whose sum is σ = 24622344463136. Its totient is φ = 3517477780440.
The previous prime is 10552433341297. The next prime is 10552433341361. The reversal of 10552433341332 is 23314333425501.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×105524333413322 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 439684722544 + ... + 439684722567.
Almost surely, 210552433341332 is an apocalyptic number.
10552433341332 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10552433341332 is an abundant number, since it is smaller than the sum of its proper divisors (14069911121804).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10552433341332 is a wasteful number, since it uses less digits than its factorization.
10552433341332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 879369445118 (or 879369445116 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 39.
Adding to 10552433341332 its reverse (23314333425501), we get a palindrome (33866766766833).
The spelling of 10552433341332 in words is "ten trillion, five hundred fifty-two billion, four hundred thirty-three million, three hundred forty-one thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •