Base | Representation |
---|---|
bin | 111101011110000000… |
… | …0010010101111000111 |
3 | 110121201112022222012102 |
4 | 1322330000102233013 |
5 | 4130320310242411 |
6 | 140350314542315 |
7 | 12352106535152 |
oct | 1727400225707 |
9 | 417645288172 |
10 | 132003212231 |
11 | 50a89410130 |
12 | 216bb73799b |
13 | c5a8c05007 |
14 | 656355cc99 |
15 | 3678b5cd3b |
hex | 1ebc012bc7 |
132003212231 has 16 divisors (see below), whose sum is σ = 150339241728. Its totient is φ = 114728328000.
The previous prime is 132003212219. The next prime is 132003212239. The reversal of 132003212231 is 132212300231.
It is not a de Polignac number, because 132003212231 - 26 = 132003212167 is a prime.
It is a super-2 number, since 2×1320032122312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132003212239) by changing a digit.
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, 384131 + ... + 641531.
It is an arithmetic number, because the mean of its divisors is an integer number (9396202608).
Almost surely, 2132003212231 is an apocalyptic number.
132003212231 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
132003212231 is a deficient number, since it is larger than the sum of its proper divisors (18336029497).
132003212231 is a wasteful number, since it uses less digits than its factorization.
132003212231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259462.
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 132003212231 its reverse (132212300231), we get a palindrome (264215512462).
The spelling of 132003212231 in words is "one hundred thirty-two billion, three million, two hundred twelve thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •