Base | Representation |
---|---|
bin | 11110000011111110010110… |
… | …010101000000010010010010 |
3 | 122100010120201212010111120010 |
4 | 132003332112111000102102 |
5 | 114312200244043030422 |
6 | 1145110300350055350 |
7 | 36564116400202536 |
oct | 3603762625002222 |
9 | 570116655114503 |
10 | 132214500361362 |
11 | 391449446a1331 |
12 | 129b40807aa556 |
13 | 58a0a0a2c7cb3 |
14 | 2491304853bc6 |
15 | 1044308a18b0c |
hex | 783f96540492 |
132214500361362 has 8 divisors (see below), whose sum is σ = 264429000722736. Its totient is φ = 44071500120452.
The previous prime is 132214500361267. The next prime is 132214500361477. The reversal of 132214500361362 is 263163005412231.
It is a sphenic number, since it is the product of 3 distinct primes.
132214500361362 is an admirable number.
It is a self number, because there is not a number n which added to its sum of digits gives 132214500361362.
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, 11017875030108 + ... + 11017875030119.
It is an arithmetic number, because the mean of its divisors is an integer number (33053625090342).
Almost surely, 2132214500361362 is an apocalyptic number.
132214500361362 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132214500361362 is a wasteful number, since it uses less digits than its factorization.
132214500361362 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22035750060232.
The product of its (nonzero) digits is 155520, while the sum is 39.
Adding to 132214500361362 its reverse (263163005412231), we get a palindrome (395377505773593).
The spelling of 132214500361362 in words is "one hundred thirty-two trillion, two hundred fourteen billion, five hundred million, three hundred sixty-one thousand, three hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •