Base | Representation |
---|---|
bin | 11110001010010111110011… |
… | …010000001000110000110100 |
3 | 122101200121112112000112200111 |
4 | 132022113303100020300310 |
5 | 114341401142340440034 |
6 | 1150044250130352404 |
7 | 36640642254552310 |
oct | 3612276320106064 |
9 | 571617475015614 |
10 | 132654146030644 |
11 | 392a4342169867 |
12 | 12a6531912b704 |
13 | 5903303477434 |
14 | 24a86d010ab40 |
15 | 105098ac57364 |
hex | 78a5f3408c34 |
132654146030644 has 24 divisors (see below), whose sum is σ = 265308566624640. Its totient is φ = 56851718035296.
The previous prime is 132654146030599. The next prime is 132654146030647. The reversal of 132654146030644 is 446030641456231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132654146030647) 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, 35271969 + ... + 38851255.
It is an arithmetic number, because the mean of its divisors is an integer number (11054523609360).
Almost surely, 2132654146030644 is an apocalyptic number.
132654146030644 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
132654146030644 is an abundant number, since it is smaller than the sum of its proper divisors (132654420593996).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132654146030644 is a wasteful number, since it uses less digits than its factorization.
132654146030644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4902927 (or 4902925 counting only the distinct ones).
The product of its (nonzero) digits is 4976640, while the sum is 49.
Adding to 132654146030644 its reverse (446030641456231), we get a palindrome (578684787486875).
The spelling of 132654146030644 in words is "one hundred thirty-two trillion, six hundred fifty-four billion, one hundred forty-six million, thirty thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.040 sec. • engine limits •