Base | Representation |
---|---|
bin | 1101010100001110… |
… | …00100011001101010 |
3 | 200110020000010201200 |
4 | 12222013010121222 |
5 | 104120112301200 |
6 | 3141214425030 |
7 | 342105022140 |
oct | 65207043152 |
9 | 20406003650 |
10 | 7148947050 |
11 | 3039437803 |
12 | 1476202176 |
13 | 89c1267ab |
14 | 4bb64d590 |
15 | 2bc93b800 |
hex | 1aa1c466a |
7148947050 has 72 divisors (see below), whose sum is σ = 21950681376. Its totient is φ = 1634044320.
The previous prime is 7148947037. The next prime is 7148947063. The reversal of 7148947050 is 507498417.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (7148947037) and next prime (7148947063).
It is a super-2 number, since 2×71489470502 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a junction number, because it is equal to n+sod(n) for n = 7148946987 and 7148947005.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1131604 + ... + 1137903.
Almost surely, 27148947050 is an apocalyptic number.
7148947050 is a gapful number since it is divisible by the number (70) formed by its first and last digit.
7148947050 is an abundant number, since it is smaller than the sum of its proper divisors (14801734326).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
7148947050 is a wasteful number, since it uses less digits than its factorization.
7148947050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2269532 (or 2269524 counting only the distinct ones).
The product of its (nonzero) digits is 282240, while the sum is 45.
The square root of 7148947050 is about 84551.4461733210. The cubic root of 7148947050 is about 1926.4039502349.
The spelling of 7148947050 in words is "seven billion, one hundred forty-eight million, nine hundred forty-seven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •