Base | Representation |
---|---|
bin | 11110000111000000110001… |
… | …001111100111000110000011 |
3 | 122100212112120112011111201212 |
4 | 132013000301033213012003 |
5 | 114324110313002034042 |
6 | 1145350223235320335 |
7 | 36615156530431262 |
oct | 3607006117470603 |
9 | 570775515144655 |
10 | 132423257846147 |
11 | 3921542a872464 |
12 | 12a286211500ab |
13 | 58b75c8a75818 |
14 | 249b469a5c5d9 |
15 | 1049975c13482 |
hex | 7870313e7183 |
132423257846147 has 4 divisors (see below), whose sum is σ = 136694975841216. Its totient is φ = 128151539851080.
The previous prime is 132423257846123. The next prime is 132423257846171. The reversal of 132423257846147 is 741648752324231.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (132423257846123) and next prime (132423257846171).
It is a cyclic number.
It is not a de Polignac number, because 132423257846147 - 28 = 132423257845891 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132423257846107) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2135858997488 + ... + 2135858997549.
It is an arithmetic number, because the mean of its divisors is an integer number (34173743960304).
Almost surely, 2132423257846147 is an apocalyptic number.
132423257846147 is a deficient number, since it is larger than the sum of its proper divisors (4271717995069).
132423257846147 is an equidigital number, since it uses as much as digits as its factorization.
132423257846147 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4271717995068.
The product of its digits is 54190080, while the sum is 59.
The spelling of 132423257846147 in words is "one hundred thirty-two trillion, four hundred twenty-three billion, two hundred fifty-seven million, eight hundred forty-six thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •