Base | Representation |
---|---|
bin | 1000101000111001000… |
… | …0110110100100011011 |
3 | 112012002100021020110020 |
4 | 2022032100312210123 |
5 | 4412423402424210 |
6 | 152103050521523 |
7 | 13502610245655 |
oct | 2121620664433 |
9 | 465070236406 |
10 | 148415670555 |
11 | 57a4085aa79 |
12 | 249201362a3 |
13 | 10cc3272309 |
14 | 727d1b96d5 |
15 | 3cd9978770 |
hex | 228e43691b |
148415670555 has 8 divisors (see below), whose sum is σ = 237465072912. Its totient is φ = 79155024288.
The previous prime is 148415670527. The next prime is 148415670569. The reversal of 148415670555 is 555076514841.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 148415670555 - 215 = 148415637787 is a prime.
It is a super-2 number, since 2×1484156705552 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 148415670498 and 148415670507.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 4947189004 + ... + 4947189033.
It is an arithmetic number, because the mean of its divisors is an integer number (29683134114).
Almost surely, 2148415670555 is an apocalyptic number.
148415670555 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
148415670555 is a deficient number, since it is larger than the sum of its proper divisors (89049402357).
148415670555 is an equidigital number, since it uses as much as digits as its factorization.
148415670555 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9894378045.
The product of its (nonzero) digits is 3360000, while the sum is 51.
The spelling of 148415670555 in words is "one hundred forty-eight billion, four hundred fifteen million, six hundred seventy thousand, five hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •