Base | Representation |
---|---|
bin | 101010110011001011… |
… | …000000101010111111 |
3 | 11101121201201110212202 |
4 | 222303023000222333 |
5 | 1223104123242314 |
6 | 33040045422115 |
7 | 3214552562066 |
oct | 526313005277 |
9 | 141551643782 |
10 | 45955680959 |
11 | 18542869321 |
12 | 8aa656a93b |
13 | 4444c01936 |
14 | 231d5611dd |
15 | 12de7b80de |
hex | ab32c0abf |
45955680959 has 8 divisors (see below), whose sum is σ = 46995621552. Its totient is φ = 44924984640.
The previous prime is 45955680943. The next prime is 45955680971. The reversal of 45955680959 is 95908655954.
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 45955680959 - 24 = 45955680943 is a prime.
It is a super-2 number, since 2×459556809592 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 45955680895 and 45955680904.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45955680919) 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, 2301014 + ... + 2320899.
It is an arithmetic number, because the mean of its divisors is an integer number (5874452694).
Almost surely, 245955680959 is an apocalyptic number.
45955680959 is a deficient number, since it is larger than the sum of its proper divisors (1039940593).
45955680959 is a wasteful number, since it uses less digits than its factorization.
45955680959 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4622137.
The product of its (nonzero) digits is 87480000, while the sum is 65.
The spelling of 45955680959 in words is "forty-five billion, nine hundred fifty-five million, six hundred eighty thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •