Base | Representation |
---|---|
bin | 10001101100100… |
… | …10111011111000 |
3 | 101100100002120120 |
4 | 20312102323320 |
5 | 301000413224 |
6 | 22421453240 |
7 | 3451545636 |
oct | 1066227370 |
9 | 340302516 |
10 | 148451064 |
11 | 76884533 |
12 | 41871220 |
13 | 249a8b88 |
14 | 15a04356 |
15 | d075779 |
hex | 8d92ef8 |
148451064 has 64 divisors (see below), whose sum is σ = 389498880. Its totient is φ = 47088000.
The previous prime is 148451063. The next prime is 148451071. The reversal of 148451064 is 460154841.
It is a Smith number, since the sum of its digits (33) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (148451063) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43749 + ... + 47019.
It is an arithmetic number, because the mean of its divisors is an integer number (6085920).
Almost surely, 2148451064 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 148451064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (194749440).
148451064 is an abundant number, since it is smaller than the sum of its proper divisors (241047816).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148451064 is a wasteful number, since it uses less digits than its factorization.
148451064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3372 (or 3368 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 33.
The square root of 148451064 is about 12184.0495731099. The cubic root of 148451064 is about 529.4940751788.
The spelling of 148451064 in words is "one hundred forty-eight million, four hundred fifty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •