Base | Representation |
---|---|
bin | 1110100110100111100000… |
… | …00100011110011101110111 |
3 | 11012200222210100100112000111 |
4 | 13103103300010132131313 |
5 | 13202120320010210403 |
6 | 152144334001523451 |
7 | 6523050053324551 |
oct | 723236004363567 |
9 | 135628710315014 |
10 | 32113203210103 |
11 | a261151028124 |
12 | 3727906943587 |
13 | 14bc3539c41c2 |
14 | 7d04046024d1 |
15 | 3aa5111d356d |
hex | 1d34f011e777 |
32113203210103 has 16 divisors (see below), whose sum is σ = 33052933009152. Its totient is φ = 31181001120000.
The previous prime is 32113203210089. The next prime is 32113203210139. The reversal of 32113203210103 is 30101230231123.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-32113203210103 is a prime.
It is a super-3 number, since 3×321132032101033 (a number of 41 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32113203213103) 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, 33363733 + ... + 34312753.
It is an arithmetic number, because the mean of its divisors is an integer number (2065808313072).
Almost surely, 232113203210103 is an apocalyptic number.
32113203210103 is a deficient number, since it is larger than the sum of its proper divisors (939729799049).
32113203210103 is a wasteful number, since it uses less digits than its factorization.
32113203210103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 952986.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 32113203210103 its reverse (30101230231123), we get a palindrome (62214433441226).
The spelling of 32113203210103 in words is "thirty-two trillion, one hundred thirteen billion, two hundred three million, two hundred ten thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •