Base | Representation |
---|---|
bin | 100101101000011010101001… |
… | …0001110000110001100101100 |
3 | 1121102000021012221102211101011 |
4 | 1023100311102032012030230 |
5 | 321341232404233300130 |
6 | 3131555554254355004 |
7 | 126502461451156630 |
oct | 11320652216061454 |
9 | 1542007187384334 |
10 | 331010213962540 |
11 | 965197093aa722 |
12 | 3115bbb6abba64 |
13 | 1129118ac326c8 |
14 | 5ba4da0966dc0 |
15 | 284050692352a |
hex | 12d0d5238632c |
331010213962540 has 48 divisors (see below), whose sum is σ = 841155367252032. Its totient is φ = 106813379966976.
The previous prime is 331010213962529. The next prime is 331010213962541. The reversal of 331010213962540 is 45269312010133.
It is a junction number, because it is equal to n+sod(n) for n = 331010213962493 and 331010213962502.
It is not an unprimeable number, because it can be changed into a prime (331010213962541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 69539958537 + ... + 69539963296.
It is an arithmetic number, because the mean of its divisors is an integer number (17524070151084).
Almost surely, 2331010213962540 is an apocalyptic number.
It is an amenable number.
331010213962540 is an abundant number, since it is smaller than the sum of its proper divisors (510145153289492).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
331010213962540 is a wasteful number, since it uses less digits than its factorization.
331010213962540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 139079921866 (or 139079921864 counting only the distinct ones).
The product of its (nonzero) digits is 116640, while the sum is 40.
Adding to 331010213962540 its reverse (45269312010133), we get a palindrome (376279525972673).
The spelling of 331010213962540 in words is "three hundred thirty-one trillion, ten billion, two hundred thirteen million, nine hundred sixty-two thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.200 sec. • engine limits •