Base | Representation |
---|---|
bin | 1001001101110010011111… |
… | …0000011010001101100100 |
3 | 1022212122201222200011022211 |
4 | 2103130213300122031210 |
5 | 2312002322140243324 |
6 | 33314445345333204 |
7 | 2064022445122411 |
oct | 223344760321544 |
9 | 38778658604284 |
10 | 10132494852964 |
11 | 3257192211100 |
12 | 11778b4037204 |
13 | 58664ab797c3 |
14 | 2705b5aa9108 |
15 | 128881d17294 |
hex | 93727c1a364 |
10132494852964 has 81 divisors (see below), whose sum is σ = 19983030766923. Its totient is φ = 4492072569600.
The previous prime is 10132494852959. The next prime is 10132494853079. The reversal of 10132494852964 is 46925849423101.
The square root of 10132494852964 is 3183158.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 7524915812964 + 2607579040000 = 2743158^2 + 1614800^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 10132494852899 and 10132494852908.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2871206752 + ... + 2871210280.
Almost surely, 210132494852964 is an apocalyptic number.
10132494852964 is the 3183158-th square number.
It is an amenable number.
10132494852964 is a deficient number, since it is larger than the sum of its proper divisors (9850535913959).
10132494852964 is an frugal number, since it uses more digits than its factorization.
10132494852964 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7166 (or 3583 counting only the distinct ones).
The product of its (nonzero) digits is 14929920, while the sum is 58.
The spelling of 10132494852964 in words is "ten trillion, one hundred thirty-two billion, four hundred ninety-four million, eight hundred fifty-two thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •