Base | Representation |
---|---|
bin | 100001001100101010010000… |
… | …111110011110000000001010 |
3 | 201010221222211212010111201221 |
4 | 201030222100332132000022 |
5 | 123114123331420231041 |
6 | 1234310005101432254 |
7 | 42516360436530622 |
oct | 4114522076360012 |
9 | 633858755114657 |
10 | 146005550555146 |
11 | 42581673a27957 |
12 | 14460a2b56b68a |
13 | 63613589a5149 |
14 | 280a9c6333882 |
15 | 11d2e158cd2d1 |
hex | 84ca90f9e00a |
146005550555146 has 32 divisors (see below), whose sum is σ = 231340283105040. Its totient is φ = 69012439566336.
The previous prime is 146005550555119. The next prime is 146005550555197. The reversal of 146005550555146 is 641555055500641.
It can be written as a sum of positive squares in 8 ways, for example, as 109119229380225 + 36886321174921 = 10446015^2 + 6073411^2 .
It is a super-2 number, since 2×1460055505551462 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 146005550555093 and 146005550555102.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 125274211 + ... + 126434326.
Almost surely, 2146005550555146 is an apocalyptic number.
146005550555146 is a deficient number, since it is larger than the sum of its proper divisors (85334732549894).
146005550555146 is a wasteful number, since it uses less digits than its factorization.
146005550555146 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 251708778.
The product of its (nonzero) digits is 9000000, while the sum is 52.
The spelling of 146005550555146 in words is "one hundred forty-six trillion, five billion, five hundred fifty million, five hundred fifty-five thousand, one hundred forty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •