Base | Representation |
---|---|
bin | 1110100110100111101100… |
… | …11011111000101101011001 |
3 | 11012201000001210022112012200 |
4 | 13103103312123320231121 |
5 | 13202121024330311301 |
6 | 152144352335000413 |
7 | 6523052521161240 |
oct | 723236633705531 |
9 | 135630053275180 |
10 | 32113310010201 |
11 | a2611a6343672 |
12 | 3727936669109 |
13 | 14bc36cb78c24 |
14 | 7d0414883957 |
15 | 3aa51a77cc86 |
hex | 1d34f66f8b59 |
32113310010201 has 72 divisors (see below), whose sum is σ = 54526332579264. Its totient is φ = 17840612568960.
The previous prime is 32113310010191. The next prime is 32113310010241. The reversal of 32113310010201 is 10201001331123.
32113310010201 is a `hidden beast` number, since 32 + 113 + 310 + 0 + 10 + 201 = 666.
It is not a de Polignac number, because 32113310010201 - 213 = 32113310002009 is a prime.
It is a super-2 number, since 2×321133100102012 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (32113310010241) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 111200671 + ... + 111489083.
It is an arithmetic number, because the mean of its divisors is an integer number (757310174712).
Almost surely, 232113310010201 is an apocalyptic number.
It is an amenable number.
32113310010201 is a deficient number, since it is larger than the sum of its proper divisors (22413022569063).
32113310010201 is a wasteful number, since it uses less digits than its factorization.
32113310010201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289791 (or 289751 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 32113310010201 its reverse (10201001331123), we get a palindrome (42314311341324).
The spelling of 32113310010201 in words is "thirty-two trillion, one hundred thirteen billion, three hundred ten million, ten thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •