Base | Representation |
---|---|
bin | 1001001010000000100111… |
… | …1111110001111110010100 |
3 | 1022122110011100002120122210 |
4 | 2102200021333301332110 |
5 | 2304421341142302112 |
6 | 33224551151153420 |
7 | 2056233540012153 |
oct | 222401177617624 |
9 | 38573140076583 |
10 | 10067571056532 |
11 | 32316a64449a0 |
12 | 11671b5215870 |
13 | 5804a22c2102 |
14 | 26b3b730d59a |
15 | 126d321b1b3c |
hex | 92809ff1f94 |
10067571056532 has 48 divisors (see below), whose sum is σ = 25654129905600. Its totient is φ = 3047495132160.
The previous prime is 10067571056507. The next prime is 10067571056539. The reversal of 10067571056532 is 23565017576001.
10067571056532 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10067571056539) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 40926607 + ... + 41171862.
It is an arithmetic number, because the mean of its divisors is an integer number (534461039700).
Almost surely, 210067571056532 is an apocalyptic number.
10067571056532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10067571056532 is an abundant number, since it is smaller than the sum of its proper divisors (15586558849068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10067571056532 is a wasteful number, since it uses less digits than its factorization.
10067571056532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82099416 (or 82099414 counting only the distinct ones).
The product of its (nonzero) digits is 1323000, while the sum is 48.
The spelling of 10067571056532 in words is "ten trillion, sixty-seven billion, five hundred seventy-one million, fifty-six thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •