Base | Representation |
---|---|
bin | 1000100001111100111… |
… | …1110100110101011011 |
3 | 112000021112120101120222 |
4 | 2020133033310311123 |
5 | 4400120100132311 |
6 | 151154154110255 |
7 | 13405503024356 |
oct | 2103717646533 |
9 | 460245511528 |
10 | 146553130331 |
11 | 5717546aa33 |
12 | 244a041b38b |
13 | 10a87425cca |
14 | 7143aa329d |
15 | 3c2b1b9adb |
hex | 221f3f4d5b |
146553130331 has 8 divisors (see below), whose sum is σ = 154853022720. Its totient is φ = 138311894952.
The previous prime is 146553130301. The next prime is 146553130337. The reversal of 146553130331 is 133031355641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 146553130331 - 230 = 145479388507 is a prime.
It is a super-2 number, since 2×1465531303312 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 146553130291 and 146553130300.
It is not an unprimeable number, because it can be changed into a prime (146553130337) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 14659115 + ... + 14669108.
It is an arithmetic number, because the mean of its divisors is an integer number (19356627840).
Almost surely, 2146553130331 is an apocalyptic number.
146553130331 is a deficient number, since it is larger than the sum of its proper divisors (8299892389).
146553130331 is a wasteful number, since it uses less digits than its factorization.
146553130331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 29328505.
The product of its (nonzero) digits is 48600, while the sum is 35.
Adding to 146553130331 its reverse (133031355641), we get a palindrome (279584485972).
The spelling of 146553130331 in words is "one hundred forty-six billion, five hundred fifty-three million, one hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •