Base | Representation |
---|---|
bin | 1110110000011011111001… |
… | …01101001010100010000001 |
3 | 11020220020121000202001012012 |
4 | 13120031330231022202001 |
5 | 13223132231423320211 |
6 | 153003330333542305 |
7 | 6556322244015215 |
oct | 730157455124201 |
9 | 136806530661165 |
10 | 32450570135681 |
11 | a3812339476a5 |
12 | 378117a344995 |
13 | 15150ca221c59 |
14 | 80288a340945 |
15 | 3b41a9113d8b |
hex | 1d837cb4a881 |
32450570135681 has 4 divisors (see below), whose sum is σ = 32452279969200. Its totient is φ = 32448860302164.
The previous prime is 32450570135657. The next prime is 32450570135707. The reversal of 32450570135681 is 18653107505423.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 32450570135681 - 226 = 32450503026817 is a prime.
It is a super-2 number, since 2×324505701356812 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (32450570135281) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 854888291 + ... + 854926248.
It is an arithmetic number, because the mean of its divisors is an integer number (8113069992300).
Almost surely, 232450570135681 is an apocalyptic number.
It is an amenable number.
32450570135681 is a deficient number, since it is larger than the sum of its proper divisors (1709833519).
32450570135681 is a wasteful number, since it uses less digits than its factorization.
32450570135681 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1709833518.
The product of its (nonzero) digits is 3024000, while the sum is 50.
The spelling of 32450570135681 in words is "thirty-two trillion, four hundred fifty billion, five hundred seventy million, one hundred thirty-five thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.110 sec. • engine limits •