Base | Representation |
---|---|
bin | 1110100111011101001100… |
… | …10010011000110111111100 |
3 | 11012210202012100020222110220 |
4 | 13103232212102120313330 |
5 | 13203103334202124200 |
6 | 152205502250301340 |
7 | 6525120320061201 |
oct | 723564622306774 |
9 | 135722170228426 |
10 | 32142030114300 |
11 | a2723a4070997 |
12 | 3731410a27850 |
13 | 14c1c99024972 |
14 | 7d197ad21ca8 |
15 | 3ab14bd384a0 |
hex | 1d3ba6498dfc |
32142030114300 has 72 divisors (see below), whose sum is σ = 93396738694896. Its totient is φ = 8534421711360.
The previous prime is 32142030114263. The next prime is 32142030114343. The reversal of 32142030114300 is 341103024123.
It is a happy number.
It is a super-2 number, since 2×321420301143002 (a number of 28 digits) contains 22 as substring.
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, 229844479 + ... + 229984278.
It is an arithmetic number, because the mean of its divisors is an integer number (1297176926318).
Almost surely, 232142030114300 is an apocalyptic number.
32142030114300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
32142030114300 is an abundant number, since it is smaller than the sum of its proper divisors (61254708580596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
32142030114300 is a wasteful number, since it uses less digits than its factorization.
32142030114300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 459829007 (or 459829000 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 24.
Adding to 32142030114300 its reverse (341103024123), we get a palindrome (32483133138423).
The spelling of 32142030114300 in words is "thirty-two trillion, one hundred forty-two billion, thirty million, one hundred fourteen thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •