Base | Representation |
---|---|
bin | 11110000001010101010101… |
… | …100001001101000100111100 |
3 | 122022111020022111010012011210 |
4 | 132001111111201031010330 |
5 | 114301212113222222022 |
6 | 1144451044542444420 |
7 | 36545033300123121 |
oct | 3601252541150474 |
9 | 568436274105153 |
10 | 132033024414012 |
11 | 39084989208057 |
12 | 12984a74893710 |
13 | 5889878963427 |
14 | 248660aa16748 |
15 | 103e736967a0c |
hex | 78155584d13c |
132033024414012 has 24 divisors (see below), whose sum is σ = 318700403758800. Its totient is φ = 42493387167616.
The previous prime is 132033024413993. The next prime is 132033024414043. The reversal of 132033024414012 is 210414420330231.
It is a super-2 number, since 2×1320330244140122 (a number of 29 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 7 ways as a sum of consecutive naturals, for example, 189702620937 + ... + 189702621632.
It is an arithmetic number, because the mean of its divisors is an integer number (13279183489950).
Almost surely, 2132033024414012 is an apocalyptic number.
132033024414012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
132033024414012 is an abundant number, since it is smaller than the sum of its proper divisors (186667379344788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132033024414012 is a wasteful number, since it uses less digits than its factorization.
132033024414012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 379405242605 (or 379405242603 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 132033024414012 its reverse (210414420330231), we get a palindrome (342447444744243).
The spelling of 132033024414012 in words is "one hundred thirty-two trillion, thirty-three billion, twenty-four million, four hundred fourteen thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •