Base | Representation |
---|---|
bin | 101010101110010111… |
… | …110001010111000001 |
3 | 11101102010011120111111 |
4 | 222232113301113001 |
5 | 1222423013440113 |
6 | 33024051243321 |
7 | 3212554153642 |
oct | 525627612701 |
9 | 141363146444 |
10 | 45875140033 |
11 | 18501358778 |
12 | 8a835a9541 |
13 | 4431312298 |
14 | 23129976c9 |
15 | 12d76a913d |
hex | aae5f15c1 |
45875140033 has 4 divisors (see below), whose sum is σ = 48573677700. Its totient is φ = 43176602368.
The previous prime is 45875140001. The next prime is 45875140139. The reversal of 45875140033 is 33004157854.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 42887096464 + 2988043569 = 207092^2 + 54663^2 .
It is a cyclic number.
It is not a de Polignac number, because 45875140033 - 25 = 45875140001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45875140733) 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 3 ways as a sum of consecutive naturals, for example, 1349268808 + ... + 1349268841.
It is an arithmetic number, because the mean of its divisors is an integer number (12143419425).
Almost surely, 245875140033 is an apocalyptic number.
It is an amenable number.
45875140033 is a deficient number, since it is larger than the sum of its proper divisors (2698537667).
45875140033 is a wasteful number, since it uses less digits than its factorization.
45875140033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2698537666.
The product of its (nonzero) digits is 201600, while the sum is 40.
Adding to 45875140033 its reverse (33004157854), we get a palindrome (78879297887).
The spelling of 45875140033 in words is "forty-five billion, eight hundred seventy-five million, one hundred forty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •