Base | Representation |
---|---|
bin | 101101110001110001010000… |
… | …001110101111101101100101 |
3 | 222101212011200111002002001112 |
4 | 231301301100032233231211 |
5 | 202342111403122310041 |
6 | 1552110430114234405 |
7 | 60256526264130311 |
oct | 5561612016575545 |
9 | 871764614062045 |
10 | 201332233010021 |
11 | 5917257a8a4aa3 |
12 | 1a6b7651585a05 |
13 | 8845718269ac9 |
14 | 37a0764008b41 |
15 | 18421a7b7adeb |
hex | b71c503afb65 |
201332233010021 has 16 divisors (see below), whose sum is σ = 208845267287040. Its totient is φ = 193857250392960.
The previous prime is 201332233009987. The next prime is 201332233010033. The reversal of 201332233010021 is 120010332233102.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-201332233010021 is a prime.
It is a super-2 number, since 2×2013322330100212 (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 (201332233810021) 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, 1435894100 + ... + 1436034306.
It is an arithmetic number, because the mean of its divisors is an integer number (13052829205440).
Almost surely, 2201332233010021 is an apocalyptic number.
It is an amenable number.
201332233010021 is a deficient number, since it is larger than the sum of its proper divisors (7513034277019).
201332233010021 is a wasteful number, since it uses less digits than its factorization.
201332233010021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 275524.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 201332233010021 its reverse (120010332233102), we get a palindrome (321342565243123).
The spelling of 201332233010021 in words is "two hundred one trillion, three hundred thirty-two billion, two hundred thirty-three million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •