Base | Representation |
---|---|
bin | 10110111110000011010110… |
… | …100101101011000110000001 |
3 | 111020200112110021121121021121 |
4 | 112332003112211223012001 |
5 | 101220112440114030420 |
6 | 554504302435152241 |
7 | 30164354164344250 |
oct | 2676032645530601 |
9 | 436615407547247 |
10 | 101021231001985 |
11 | 2a2089553120a8 |
12 | b3b6711a45681 |
13 | 444a351b46948 |
14 | 1ad364cc20797 |
15 | ba2bd9db32aa |
hex | 5be0d696b181 |
101021231001985 has 16 divisors (see below), whose sum is σ = 138543921991296. Its totient is φ = 69271441521408.
The previous prime is 101021231001959. The next prime is 101021231002007. The reversal of 101021231001985 is 589100132120101.
It is a happy number.
It is not a de Polignac number, because 101021231001985 - 29 = 101021231001473 is a prime.
It is a super-2 number, since 2×1010212310019852 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 101021231001985.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4302214 + ... + 14850976.
It is an arithmetic number, because the mean of its divisors is an integer number (8658995124456).
Almost surely, 2101021231001985 is an apocalyptic number.
It is an amenable number.
101021231001985 is a deficient number, since it is larger than the sum of its proper divisors (37522690989311).
101021231001985 is a wasteful number, since it uses less digits than its factorization.
101021231001985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10822392.
The product of its (nonzero) digits is 4320, while the sum is 34.
The spelling of 101021231001985 in words is "one hundred one trillion, twenty-one billion, two hundred thirty-one million, one thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •