Base | Representation |
---|---|
bin | 100001110010100100010001… |
… | …111111111011111001001000 |
3 | 201111012000120211221111002222 |
4 | 201302210101333323321020 |
5 | 123434313213114210320 |
6 | 1244022412202513212 |
7 | 43205515604321111 |
oct | 4162442177737110 |
9 | 644160524844088 |
10 | 148610465381960 |
11 | 4339638749437a |
12 | 14801854205808 |
13 | 64bcba31a365a |
14 | 289aadbab7208 |
15 | 122aa74e58825 |
hex | 872911ffbe48 |
148610465381960 has 32 divisors (see below), whose sum is σ = 334375653200760. Its totient is φ = 59443811736576.
The previous prime is 148610465381951. The next prime is 148610465382011. The reversal of 148610465381960 is 69183564016841.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 132078613562116 + 16531851819844 = 11492546^2 + 4065938^2 .
It is a junction number, because it is equal to n+sod(n) for n = 148610465381893 and 148610465381902.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5226299 + ... + 18014858.
Almost surely, 2148610465381960 is an apocalyptic number.
148610465381960 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
148610465381960 is an abundant number, since it is smaller than the sum of its proper divisors (185765187818800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148610465381960 is a wasteful number, since it uses less digits than its factorization.
148610465381960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23401025 (or 23401021 counting only the distinct ones).
The product of its (nonzero) digits is 29859840, while the sum is 62.
The spelling of 148610465381960 in words is "one hundred forty-eight trillion, six hundred ten billion, four hundred sixty-five million, three hundred eighty-one thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •