Base | Representation |
---|---|
bin | 11101110101011000… |
… | …110001111000100011 |
3 | 10001200112000000201110 |
4 | 131311120301320203 |
5 | 1011101223413443 |
6 | 22414420034403 |
7 | 2212560134241 |
oct | 356530617043 |
9 | 101615000643 |
10 | 32034201123 |
11 | 12649520491 |
12 | 6260232a03 |
13 | 30369556c2 |
14 | 179c687791 |
15 | c774e5233 |
hex | 775631e23 |
32034201123 has 8 divisors (see below), whose sum is σ = 42744606736. Its totient is φ = 21339964800.
The previous prime is 32034201113. The next prime is 32034201127. The reversal of 32034201123 is 32110243023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 32034201123 - 216 = 32034135587 is a prime.
It is a super-2 number, since 2×320342011232 (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 32034201123.
It is not an unprimeable number, because it can be changed into a prime (32034201127) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4037698 + ... + 4045623.
It is an arithmetic number, because the mean of its divisors is an integer number (5343075842).
Almost surely, 232034201123 is an apocalyptic number.
32034201123 is a deficient number, since it is larger than the sum of its proper divisors (10710405613).
32034201123 is a wasteful number, since it uses less digits than its factorization.
32034201123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8084645.
The product of its (nonzero) digits is 864, while the sum is 21.
Adding to 32034201123 its reverse (32110243023), we get a palindrome (64144444146).
The spelling of 32034201123 in words is "thirty-two billion, thirty-four million, two hundred one thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •