Base | Representation |
---|---|
bin | 1001100011010000011100… |
… | …1010000111001010101110 |
3 | 1101011220201201002111022112 |
4 | 2120310013022013022232 |
5 | 2334023143133130110 |
6 | 34200123152044022 |
7 | 2132460243551204 |
oct | 230640712071256 |
9 | 41156651074275 |
10 | 10501315130030 |
11 | 338964569313a |
12 | 1217285233612 |
13 | 5b23678aab3a |
14 | 2843a2c91074 |
15 | 13326b254405 |
hex | 98d072872ae |
10501315130030 has 8 divisors (see below), whose sum is σ = 18902367234072. Its totient is φ = 4200526052008.
The previous prime is 10501315129933. The next prime is 10501315130051. The reversal of 10501315130030 is 3003151310501.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×105013151300302 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10501315129978 and 10501315130005.
It is a congruent number.
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, 525065756492 + ... + 525065756511.
It is an arithmetic number, because the mean of its divisors is an integer number (2362795904259).
Almost surely, 210501315130030 is an apocalyptic number.
10501315130030 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
10501315130030 is a deficient number, since it is larger than the sum of its proper divisors (8401052104042).
10501315130030 is a wasteful number, since it uses less digits than its factorization.
10501315130030 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1050131513010.
The product of its (nonzero) digits is 675, while the sum is 23.
Adding to 10501315130030 its reverse (3003151310501), we get a palindrome (13504466440531).
The spelling of 10501315130030 in words is "ten trillion, five hundred one billion, three hundred fifteen million, one hundred thirty thousand, thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •