Base | Representation |
---|---|
bin | 1001010010100110010111… |
… | …0111100110000100001100 |
3 | 1100011120001202112210122202 |
4 | 2110221211313212010030 |
5 | 2314331102133140130 |
6 | 33420434321501032 |
7 | 2103006503264426 |
oct | 224514567460414 |
9 | 40146052483582 |
10 | 10215141302540 |
11 | 3289242a58999 |
12 | 118b91a1a1778 |
13 | 59138c3688c5 |
14 | 2745b60d7816 |
15 | 12aabc7de145 |
hex | 94a65de610c |
10215141302540 has 12 divisors (see below), whose sum is σ = 21451796735376. Its totient is φ = 4086056521008.
The previous prime is 10215141302521. The next prime is 10215141302593. The reversal of 10215141302540 is 4520314151201.
It is a happy number.
It is a super-2 number, since 2×102151413025402 (a number of 27 digits) contains 22 as substring.
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, 255378532544 + ... + 255378532583.
It is an arithmetic number, because the mean of its divisors is an integer number (1787649727948).
Almost surely, 210215141302540 is an apocalyptic number.
10215141302540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
10215141302540 is an abundant number, since it is smaller than the sum of its proper divisors (11236655432836).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10215141302540 is a wasteful number, since it uses less digits than its factorization.
10215141302540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 510757065136 (or 510757065134 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 29.
Adding to 10215141302540 its reverse (4520314151201), we get a palindrome (14735455453741).
The spelling of 10215141302540 in words is "ten trillion, two hundred fifteen billion, one hundred forty-one million, three hundred two thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •