Base | Representation |
---|---|
bin | 11110000011111100001110… |
… | …000100011000110011111011 |
3 | 122100010100211112111202101202 |
4 | 132003330032010120303323 |
5 | 114312131103330211440 |
6 | 1145105241444004415 |
7 | 36564005631061340 |
oct | 3603741604306373 |
9 | 570110745452352 |
10 | 132212214303995 |
11 | 39143981233621 |
12 | 129b374309070b |
13 | 58a07347c5127 |
14 | 2491168db47c7 |
15 | 1044222e9d615 |
hex | 783f0e118cfb |
132212214303995 has 8 divisors (see below), whose sum is σ = 181319608188384. Its totient is φ = 90659804094144.
The previous prime is 132212214303887. The next prime is 132212214303997. The reversal of 132212214303995 is 599303412212231.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 132212214303995 - 236 = 132143494827259 is a prime.
It is a super-4 number, since 4×1322122143039954 (a number of 58 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132212214303997) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1888745918594 + ... + 1888745918663.
It is an arithmetic number, because the mean of its divisors is an integer number (22664951023548).
Almost surely, 2132212214303995 is an apocalyptic number.
132212214303995 is a deficient number, since it is larger than the sum of its proper divisors (49107393884389).
132212214303995 is an equidigital number, since it uses as much as digits as its factorization.
132212214303995 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3777491837269.
The product of its (nonzero) digits is 699840, while the sum is 47.
The spelling of 132212214303995 in words is "one hundred thirty-two trillion, two hundred twelve billion, two hundred fourteen million, three hundred three thousand, nine hundred ninety-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •