Base | Representation |
---|---|
bin | 110001011000110000… |
… | …1000110111011001000 |
3 | 101010202022211021012201 |
4 | 1202301201012323020 |
5 | 3214201202231243 |
6 | 120415551245544 |
7 | 10443126355651 |
oct | 1426141067310 |
9 | 333668737181 |
10 | 106057461448 |
11 | 40a84743594 |
12 | 1867a5198b4 |
13 | a002776b63 |
14 | 51c174a528 |
15 | 2b5ae2304d |
hex | 18b1846ec8 |
106057461448 has 32 divisors (see below), whose sum is σ = 210130387200. Its totient is φ = 50081061888.
The previous prime is 106057461439. The next prime is 106057461457. The reversal of 106057461448 is 844164750601.
106057461448 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (106057461439) and next prime (106057461457).
It is a super-2 number, since 2×1060574614482 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (46).
It is a junction number, because it is equal to n+sod(n) for n = 106057461398 and 106057461407.
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, 3633561 + ... + 3662632.
It is an arithmetic number, because the mean of its divisors is an integer number (6566574600).
Almost surely, 2106057461448 is an apocalyptic number.
It is an amenable number.
106057461448 is a deficient number, since it is larger than the sum of its proper divisors (104072925752).
106057461448 is a wasteful number, since it uses less digits than its factorization.
106057461448 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7296301 (or 7296297 counting only the distinct ones).
The product of its (nonzero) digits is 645120, while the sum is 46.
The spelling of 106057461448 in words is "one hundred six billion, fifty-seven million, four hundred sixty-one thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •