Base | Representation |
---|---|
bin | 11101111011110100… |
… | …010111011110100101 |
3 | 10001222001000200001212 |
4 | 131323310113132211 |
5 | 1011311334040133 |
6 | 22433232401205 |
7 | 2215340211356 |
oct | 357364273645 |
9 | 101861020055 |
10 | 32142096293 |
11 | 126a441474a |
12 | 62903a6205 |
13 | 30531019b8 |
14 | 17acb31d2d |
15 | c81c09148 |
hex | 77bd177a5 |
32142096293 has 8 divisors (see below), whose sum is σ = 32228219520. Its totient is φ = 32056018720.
The previous prime is 32142096289. The next prime is 32142096319. The reversal of 32142096293 is 39269024123.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 32142096293 - 22 = 32142096289 is a prime.
It is a super-2 number, since 2×321420962932 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 32142096293.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (32142296293) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1757828 + ... + 1776018.
It is an arithmetic number, because the mean of its divisors is an integer number (4028527440).
Almost surely, 232142096293 is an apocalyptic number.
It is an amenable number.
32142096293 is a deficient number, since it is larger than the sum of its proper divisors (86123227).
32142096293 is a wasteful number, since it uses less digits than its factorization.
32142096293 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22827.
The product of its (nonzero) digits is 139968, while the sum is 41.
The spelling of 32142096293 in words is "thirty-two billion, one hundred forty-two million, ninety-six thousand, two hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •