Base | Representation |
---|---|
bin | 1001010001110001110011… |
… | …1100110001101000111011 |
3 | 1100010012122112022220010021 |
4 | 2110130130330301220323 |
5 | 2314113203423201021 |
6 | 33410142340231311 |
7 | 2102000052005266 |
oct | 224343474615073 |
9 | 40105575286107 |
10 | 10201033022011 |
11 | 3283263222a17 |
12 | 118904139b537 |
13 | 58cc514a7210 |
14 | 273a384b5cdd |
15 | 12a543e1cc41 |
hex | 9471cf31a3b |
10201033022011 has 4 divisors (see below), whose sum is σ = 10985727869872. Its totient is φ = 9416338174152.
The previous prime is 10201033021997. The next prime is 10201033022029. The reversal of 10201033022011 is 11022033010201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 10201033022011 - 235 = 10166673283643 is a prime.
It is a super-2 number, since 2×102010330220112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (10201033022711) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 392347423911 + ... + 392347423936.
It is an arithmetic number, because the mean of its divisors is an integer number (2746431967468).
Almost surely, 210201033022011 is an apocalyptic number.
10201033022011 is a deficient number, since it is larger than the sum of its proper divisors (784694847861).
10201033022011 is an equidigital number, since it uses as much as digits as its factorization.
10201033022011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 784694847860.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 10201033022011 its reverse (11022033010201), we get a palindrome (21223066032212).
The spelling of 10201033022011 in words is "ten trillion, two hundred one billion, thirty-three million, twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •