Base | Representation |
---|---|
bin | 1110100110100111011111… |
… | …11000010110010100011010 |
3 | 11012200222210010101000010000 |
4 | 13103103233320112110122 |
5 | 13202120313201443002 |
6 | 152144333405433430 |
7 | 6523050014314206 |
oct | 723235770262432 |
9 | 135628703330100 |
10 | 32113200031002 |
11 | a26114a256672 |
12 | 372790586b876 |
13 | 14bc35315018c |
14 | 7d0404015b06 |
15 | 3aa510ca661c |
hex | 1d34efe1651a |
32113200031002 has 80 divisors (see below), whose sum is σ = 72071558861544. Its totient is φ = 10687420800000.
The previous prime is 32113200030971. The next prime is 32113200031013. The reversal of 32113200031002 is 20013000231123.
32113200031002 is a `hidden beast` number, since 32 + 1 + 1 + 320 + 0 + 0 + 310 + 0 + 2 = 666.
It can be written as a sum of positive squares in 4 ways, for example, as 17018273353041 + 15094926677961 = 4125321^2 + 3885219^2 .
It is a super-2 number, since 2×321132000310022 (a number of 28 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 372495502 + ... + 372581702.
Almost surely, 232113200031002 is an apocalyptic number.
32113200031002 is an abundant number, since it is smaller than the sum of its proper divisors (39958358830542).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32113200031002 is a wasteful number, since it uses less digits than its factorization.
32113200031002 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 89837 (or 89828 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 32113200031002 its reverse (20013000231123), we get a palindrome (52126200262125).
The spelling of 32113200031002 in words is "thirty-two trillion, one hundred thirteen billion, two hundred million, thirty-one thousand, two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •