Base | Representation |
---|---|
bin | 101010110101101111… |
… | …110011100110001111 |
3 | 11101201202000021102110 |
4 | 222311233303212033 |
5 | 1223201203144132 |
6 | 33044231355103 |
7 | 3215616016161 |
oct | 526557634617 |
9 | 141652007373 |
10 | 45998881167 |
11 | 18565195278 |
12 | 8ab8b22a93 |
13 | 4450b48ca5 |
14 | 23251a8931 |
15 | 12e349d1cc |
hex | ab5bf398f |
45998881167 has 8 divisors (see below), whose sum is σ = 61939087920. Its totient is φ = 30362297600.
The previous prime is 45998881157. The next prime is 45998881177. The reversal of 45998881167 is 76118889954.
It is an interprime number because it is at equal distance from previous prime (45998881157) and next prime (45998881177).
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 45998881167 - 27 = 45998881039 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45998881098 and 45998881107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45998881157) 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, 75905442 + ... + 75906047.
It is an arithmetic number, because the mean of its divisors is an integer number (7742385990).
Almost surely, 245998881167 is an apocalyptic number.
45998881167 is a deficient number, since it is larger than the sum of its proper divisors (15940206753).
45998881167 is a wasteful number, since it uses less digits than its factorization.
45998881167 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151811593.
The product of its digits is 34836480, while the sum is 66.
The spelling of 45998881167 in words is "forty-five billion, nine hundred ninety-eight million, eight hundred eighty-one thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •