Base | Representation |
---|---|
bin | 1000101001110001000… |
… | …0101011110011001001 |
3 | 112012200201011012010120 |
4 | 2022130100223303021 |
5 | 4413414012214330 |
6 | 152142240133453 |
7 | 13511461315455 |
oct | 2123420536311 |
9 | 465621135116 |
10 | 148650507465 |
11 | 58051377469 |
12 | 24986907289 |
13 | 1102cb06075 |
14 | 72a2469665 |
15 | 3d003b4c10 |
hex | 229c42bcc9 |
148650507465 has 32 divisors (see below), whose sum is σ = 242659397376. Its totient is φ = 77683964160.
The previous prime is 148650507463. The next prime is 148650507487. The reversal of 148650507465 is 564705056841.
It is a happy number.
It is not a de Polignac number, because 148650507465 - 21 = 148650507463 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (148650507463) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 68214 + ... + 549503.
It is an arithmetic number, because the mean of its divisors is an integer number (7583106168).
Almost surely, 2148650507465 is an apocalyptic number.
148650507465 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
148650507465 is a deficient number, since it is larger than the sum of its proper divisors (94008889911).
148650507465 is a wasteful number, since it uses less digits than its factorization.
148650507465 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 618049.
The product of its (nonzero) digits is 4032000, while the sum is 51.
The spelling of 148650507465 in words is "one hundred forty-eight billion, six hundred fifty million, five hundred seven thousand, four hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •