Base | Representation |
---|---|
bin | 11111000000100111000… |
… | …010011000111011100010 |
3 | 21112201101011202221120200 |
4 | 133000213002120323202 |
5 | 234403200412413032 |
6 | 4310540544450030 |
7 | 306646100141460 |
oct | 37004702307342 |
9 | 7481334687520 |
10 | 2130958716642 |
11 | 751809706a18 |
12 | 2a4bb1919916 |
13 | 125c43c50352 |
14 | 751d33db830 |
15 | 3a6700ba47c |
hex | 1f027098ee2 |
2130958716642 has 48 divisors (see below), whose sum is σ = 5286749058240. Its totient is φ = 607681188576.
The previous prime is 2130958716641. The next prime is 2130958716671. The reversal of 2130958716642 is 2466178590312.
It is a happy number.
2130958716642 is a `hidden beast` number, since 2 + 1 + 3 + 0 + 9 + 587 + 16 + 6 + 42 = 666.
It is not an unprimeable number, because it can be changed into a prime (2130958716641) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 16102717 + ... + 16234512.
It is an arithmetic number, because the mean of its divisors is an integer number (110140605380).
It is a 1-persistent number, because it is pandigital, but 2⋅2130958716642 = 4261917433284 is not.
Almost surely, 22130958716642 is an apocalyptic number.
2130958716642 is an abundant number, since it is smaller than the sum of its proper divisors (3155790341598).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2130958716642 is a wasteful number, since it uses less digits than its factorization.
2130958716642 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32337767 (or 32337764 counting only the distinct ones).
The product of its (nonzero) digits is 4354560, while the sum is 54.
The spelling of 2130958716642 in words is "two trillion, one hundred thirty billion, nine hundred fifty-eight million, seven hundred sixteen thousand, six hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •