Base | Representation |
---|---|
bin | 11101011001111001000… |
… | …10011011001010100001 |
3 | 10120120211211201202212220 |
4 | 32230330202123022201 |
5 | 113023130220043211 |
6 | 2052050205541253 |
7 | 132664664363625 |
oct | 16547442331241 |
9 | 3516754652786 |
10 | 1010332971681 |
11 | 35a530694510 |
12 | 143986574829 |
13 | 74373c59577 |
14 | 36c868c3185 |
15 | 1b433997806 |
hex | eb3c89b2a1 |
1010332971681 has 16 divisors (see below), whose sum is σ = 1520250240960. Its totient is φ = 591208425920.
The previous prime is 1010332971679. The next prime is 1010332971719. The reversal of 1010332971681 is 1861792330101.
1010332971681 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 1010332971681 - 21 = 1010332971679 is a prime.
It is a super-2 number, since 2×10103329716812 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1010332971601) 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, 527863710 + ... + 527865623.
It is an arithmetic number, because the mean of its divisors is an integer number (95015640060).
Almost surely, 21010332971681 is an apocalyptic number.
1010332971681 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1010332971681 is a deficient number, since it is larger than the sum of its proper divisors (509917269279).
1010332971681 is a wasteful number, since it uses less digits than its factorization.
1010332971681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1055729376.
The product of its (nonzero) digits is 54432, while the sum is 42.
The spelling of 1010332971681 in words is "one trillion, ten billion, three hundred thirty-two million, nine hundred seventy-one thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •