Base | Representation |
---|---|
bin | 1110101010000001011100… |
… | …11001110010101000010100 |
3 | 11020010011210222002220110002 |
4 | 13111000232121302220110 |
5 | 13211024434023231400 |
6 | 152314204441550432 |
7 | 6534361504104116 |
oct | 725005631625024 |
9 | 136104728086402 |
10 | 32230213102100 |
11 | a2a6836068902 |
12 | 37465211a5418 |
13 | 14ca3b057b6a0 |
14 | 7d5d447993b6 |
15 | 3ad5ad8eaed5 |
hex | 1d502e672a14 |
32230213102100 has 72 divisors (see below), whose sum is σ = 75320760751320. Its totient is φ = 11900191726080.
The previous prime is 32230213102091. The next prime is 32230213102117. The reversal of 32230213102100 is 120131203223.
32230213102100 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 12 ways, for example, as 16640492684176 + 15589720417924 = 4079276^2 + 3948382^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 97351646 + ... + 97682154.
Almost surely, 232230213102100 is an apocalyptic number.
It is an amenable number.
32230213102100 is an abundant number, since it is smaller than the sum of its proper divisors (43090547649220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32230213102100 is a wasteful number, since it uses less digits than its factorization.
32230213102100 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 405549 (or 405542 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 32230213102100 its reverse (120131203223), we get a palindrome (32350344305323).
The spelling of 32230213102100 in words is "thirty-two trillion, two hundred thirty billion, two hundred thirteen million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •