Base | Representation |
---|---|
bin | 10001100101001… |
… | …01001001001000 |
3 | 101021111121111111 |
4 | 20302211021020 |
5 | 300223231224 |
6 | 22344540104 |
7 | 3440351200 |
oct | 1062451110 |
9 | 337447444 |
10 | 147477064 |
11 | 76279779 |
12 | 41481634 |
13 | 24727747 |
14 | 1582d400 |
15 | ce31d94 |
hex | 8ca5248 |
147477064 has 48 divisors (see below), whose sum is σ = 332783100. Its totient is φ = 61020288.
The previous prime is 147477061. The next prime is 147477103. The reversal of 147477064 is 460774741.
It can be written as a sum of positive squares in 2 ways, for example, as 130188100 + 17288964 = 11410^2 + 4158^2 .
It is not an unprimeable number, because it can be changed into a prime (147477061) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4882 + ... + 17854.
Almost surely, 2147477064 is an apocalyptic number.
147477064 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 147477064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (166391550).
147477064 is an abundant number, since it is smaller than the sum of its proper divisors (185306036).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
147477064 is a wasteful number, since it uses less digits than its factorization.
147477064 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13022 (or 13011 counting only the distinct ones).
The product of its (nonzero) digits is 131712, while the sum is 40.
The square root of 147477064 is about 12144.0135046038. The cubic root of 147477064 is about 528.3335148014. Note that the first 3 decimals are identical.
The spelling of 147477064 in words is "one hundred forty-seven million, four hundred seventy-seven thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •