Base | Representation |
---|---|
bin | 1011100100010… |
… | …0010000010100 |
3 | 10101021202210100 |
4 | 2321010100110 |
5 | 44404422233 |
6 | 4451454100 |
7 | 1126235301 |
oct | 271042024 |
9 | 111252710 |
10 | 48514068 |
11 | 25426379 |
12 | 142b7330 |
13 | a087c65 |
14 | 662c0a8 |
15 | 43d4813 |
hex | 2e44414 |
48514068 has 54 divisors (see below), whose sum is σ = 129461514. Its totient is φ = 15316128.
The previous prime is 48514043. The next prime is 48514069. The reversal of 48514068 is 86041584.
It can be written as a sum of positive squares in only one way, i.e., 42224004 + 6290064 = 6498^2 + 2508^2 .
It is a super-2 number, since 2×485140682 = 4707229587817248, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48514069) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 11130 + ... + 14862.
Almost surely, 248514068 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 48514068, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64730757).
48514068 is an abundant number, since it is smaller than the sum of its proper divisors (80947446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48514068 is a wasteful number, since it uses less digits than its factorization.
48514068 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3781 (or 3757 counting only the distinct ones).
The product of its (nonzero) digits is 30720, while the sum is 36.
The square root of 48514068 is about 6965.2040888979. The cubic root of 48514068 is about 364.7169081586.
The spelling of 48514068 in words is "forty-eight million, five hundred fourteen thousand, sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •