Base | Representation |
---|---|
bin | 1001011011001111101100… |
… | …0001111001011011011110 |
3 | 1100200202110011120101211120 |
4 | 2112303323001321123132 |
5 | 2324244300202242132 |
6 | 34013001105031410 |
7 | 2116515320303514 |
oct | 226637301713336 |
9 | 40622404511746 |
10 | 10363672696542 |
11 | 3336233069680 |
12 | 11b4671025566 |
13 | 5a23a0598419 |
14 | 27b8667d84b4 |
15 | 12e8b24c602c |
hex | 96cfb0796de |
10363672696542 has 64 divisors (see below), whose sum is σ = 22776826060800. Its totient is φ = 3117570662880.
The previous prime is 10363672696537. The next prime is 10363672696561. The reversal of 10363672696542 is 24569627636301.
It is a super-3 number, since 3×103636726965423 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 90646209 + ... + 90760467.
It is an arithmetic number, because the mean of its divisors is an integer number (355887907200).
Almost surely, 210363672696542 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10363672696542, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (11388413030400).
10363672696542 is an abundant number, since it is smaller than the sum of its proper divisors (12413153364258).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10363672696542 is a wasteful number, since it uses less digits than its factorization.
10363672696542 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124301.
The product of its (nonzero) digits is 58786560, while the sum is 60.
The spelling of 10363672696542 in words is "ten trillion, three hundred sixty-three billion, six hundred seventy-two million, six hundred ninety-six thousand, five hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •