Base | Representation |
---|---|
bin | 1110100011100111101011… |
… | …10011000101110110100111 |
3 | 11012100010222021110112102121 |
4 | 13101303311303011312213 |
5 | 13143423412321213111 |
6 | 152025143032250411 |
7 | 6512443044333214 |
oct | 721636563056647 |
9 | 135303867415377 |
10 | 32010220101031 |
11 | a221504819027 |
12 | 370b965b40a07 |
13 | 14b2721165483 |
14 | 7c94352d4b0b |
15 | 3a79d513e871 |
hex | 1d1cf5cc5da7 |
32010220101031 has 16 divisors (see below), whose sum is σ = 33282844358400. Its totient is φ = 30749020178688.
The previous prime is 32010220101023. The next prime is 32010220101071. The reversal of 32010220101031 is 13010102201023.
It is a cyclic number.
It is not a de Polignac number, because 32010220101031 - 23 = 32010220101023 is a prime.
It is a super-2 number, since 2×320102201010312 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 32010220100996 and 32010220101014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32010220101071) 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, 9074635 + ... + 12098323.
It is an arithmetic number, because the mean of its divisors is an integer number (2080177772400).
Almost surely, 232010220101031 is an apocalyptic number.
32010220101031 is a deficient number, since it is larger than the sum of its proper divisors (1272624257369).
32010220101031 is a wasteful number, since it uses less digits than its factorization.
32010220101031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3025578.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 32010220101031 its reverse (13010102201023), we get a palindrome (45020322302054).
The spelling of 32010220101031 in words is "thirty-two trillion, ten billion, two hundred twenty million, one hundred one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •