Base | Representation |
---|---|
bin | 1001010001011101001011… |
… | …1100000000001011101000 |
3 | 1100002200100200002012201010 |
4 | 2110113102330000023220 |
5 | 2314020334030310102 |
6 | 33403425114023520 |
7 | 2101412621656656 |
oct | 224272274001350 |
9 | 40080320065633 |
10 | 10195496338152 |
11 | 3280981983434 |
12 | 1187b57117ba0 |
13 | 58c57b3bb218 |
14 | 27367102ddd6 |
15 | 12a31cd03d6c |
hex | 945d2f002e8 |
10195496338152 has 32 divisors (see below), whose sum is σ = 25906589059680. Its totient is φ = 3342785684160.
The previous prime is 10195496338021. The next prime is 10195496338217. The reversal of 10195496338152 is 25183369459101.
It is a super-2 number, since 2×101954963381522 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10195496338092 and 10195496338101.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3482066958 + ... + 3482069885.
It is an arithmetic number, because the mean of its divisors is an integer number (809580908115).
Almost surely, 210195496338152 is an apocalyptic number.
10195496338152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10195496338152 is an abundant number, since it is smaller than the sum of its proper divisors (15711092721528).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10195496338152 is a wasteful number, since it uses less digits than its factorization.
10195496338152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6964136913 (or 6964136909 counting only the distinct ones).
The product of its (nonzero) digits is 6998400, while the sum is 57.
The spelling of 10195496338152 in words is "ten trillion, one hundred ninety-five billion, four hundred ninety-six million, three hundred thirty-eight thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •