Base | Representation |
---|---|
bin | 10100100000111000011111… |
… | …01001100000111101011011 |
3 | 12220201111120122120111201012 |
4 | 22100130033221200331123 |
5 | 21403041400314113120 |
6 | 235535215415244135 |
7 | 12334053246550406 |
oct | 1220341751407533 |
9 | 186644518514635 |
10 | 45110304051035 |
11 | 13412199682793 |
12 | 508681967964b |
13 | 1c22b63b44582 |
14 | b1d4c9590d3d |
15 | 5336510951c5 |
hex | 29070fa60f5b |
45110304051035 has 32 divisors (see below), whose sum is σ = 54967465728000. Its totient is φ = 35532880830720.
The previous prime is 45110304050993. The next prime is 45110304051041. The reversal of 45110304051035 is 53015040301154.
45110304051035 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 45110304051035 - 210 = 45110304050011 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 45110304050992 and 45110304051010.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1075083386 + ... + 1075125344.
It is an arithmetic number, because the mean of its divisors is an integer number (1717733304000).
Almost surely, 245110304051035 is an apocalyptic number.
45110304051035 is a deficient number, since it is larger than the sum of its proper divisors (9857161676965).
45110304051035 is a wasteful number, since it uses less digits than its factorization.
45110304051035 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 45971.
The product of its (nonzero) digits is 18000, while the sum is 32.
Adding to 45110304051035 its reverse (53015040301154), we get a palindrome (98125344352189).
The spelling of 45110304051035 in words is "forty-five trillion, one hundred ten billion, three hundred four million, fifty-one thousand, thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •