Base | Representation |
---|---|
bin | 10111000100001110111101… |
… | …001001111100011010110101 |
3 | 111022012010212120211120022021 |
4 | 113010032331021330122311 |
5 | 101244042410023033241 |
6 | 555431352443033141 |
7 | 30240142412661205 |
oct | 2704167511743265 |
9 | 438163776746267 |
10 | 101446006064821 |
11 | 2a362011805940 |
12 | b464aba20b7b1 |
13 | 447b418212782 |
14 | 1b0a027536405 |
15 | badc9b84b0d1 |
hex | 5c43bd27c6b5 |
101446006064821 has 16 divisors (see below), whose sum is σ = 111377939623488. Its totient is φ = 91632645273600.
The previous prime is 101446006064807. The next prime is 101446006064857. The reversal of 101446006064821 is 128460600644101.
It is a cyclic number.
It is not a de Polignac number, because 101446006064821 - 221 = 101446003967669 is a prime.
It is a super-2 number, since 2×1014460060648212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101446006064801) 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, 1257100 + ... + 14299381.
It is an arithmetic number, because the mean of its divisors is an integer number (6961121226468).
Almost surely, 2101446006064821 is an apocalyptic number.
101446006064821 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
101446006064821 is a deficient number, since it is larger than the sum of its proper divisors (9931933558667).
101446006064821 is a wasteful number, since it uses less digits than its factorization.
101446006064821 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15560292.
The product of its (nonzero) digits is 221184, while the sum is 43.
The spelling of 101446006064821 in words is "one hundred one trillion, four hundred forty-six billion, six million, sixty-four thousand, eight hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •