Base | Representation |
---|---|
bin | 100100111101100101000… |
… | …011100101101000011010 |
3 | 22222211020102211122222220 |
4 | 210331211003211220122 |
5 | 313103430401030242 |
6 | 5222511455324510 |
7 | 351340043133312 |
oct | 44754503455032 |
9 | 8884212748886 |
10 | 2540021111322 |
11 | 89a2427765a2 |
12 | 350333b20736 |
13 | 1556a4c468b6 |
14 | 8ad1adb8442 |
15 | 461123b7bec |
hex | 24f650e5a1a |
2540021111322 has 8 divisors (see below), whose sum is σ = 5080042222656. Its totient is φ = 846673703772.
The previous prime is 2540021111279. The next prime is 2540021111449. The reversal of 2540021111322 is 2231111200452.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
2540021111322 is an admirable number.
It is a super-2 number, since 2×25400211113222 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2540021111292 and 2540021111301.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 211668425938 + ... + 211668425949.
It is an arithmetic number, because the mean of its divisors is an integer number (635005277832).
Almost surely, 22540021111322 is an apocalyptic number.
2540021111322 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2540021111322 is a wasteful number, since it uses less digits than its factorization.
2540021111322 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 423336851892.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 2540021111322 its reverse (2231111200452), we get a palindrome (4771132311774).
The spelling of 2540021111322 in words is "two trillion, five hundred forty billion, twenty-one million, one hundred eleven thousand, three hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •