Base | Representation |
---|---|
bin | 10001101110110… |
… | …11000101001010 |
3 | 101100220002221020 |
4 | 20313123011022 |
5 | 301034342240 |
6 | 22432053310 |
7 | 3454216320 |
oct | 1067330512 |
9 | 340802836 |
10 | 148746570 |
11 | 76a66555 |
12 | 41994236 |
13 | 24a8052b |
14 | 15a7dd10 |
15 | d0d30d0 |
hex | 8ddb14a |
148746570 has 64 divisors (see below), whose sum is σ = 411181056. Its totient is φ = 33733440.
The previous prime is 148746569. The next prime is 148746593. The reversal of 148746570 is 75647841.
148746570 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24807 + ... + 30213.
It is an arithmetic number, because the mean of its divisors is an integer number (6424704).
Almost surely, 2148746570 is an apocalyptic number.
148746570 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 148746570, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (205590528).
148746570 is an abundant number, since it is smaller than the sum of its proper divisors (262434486).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148746570 is a wasteful number, since it uses less digits than its factorization.
148746570 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5555.
The product of its (nonzero) digits is 188160, while the sum is 42.
The square root of 148746570 is about 12196.1703005493. The cubic root of 148746570 is about 529.8451784643.
The spelling of 148746570 in words is "one hundred forty-eight million, seven hundred forty-six thousand, five hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •