Base | Representation |
---|---|
bin | 101010000000110001… |
… | …000000011010011011 |
3 | 11022102210102121022000 |
4 | 222000301000122123 |
5 | 1214341130101410 |
6 | 32420115532043 |
7 | 3154603462524 |
oct | 520061003233 |
9 | 138383377260 |
10 | 45110003355 |
11 | 1814946a20a |
12 | 88ab2ba023 |
13 | 433b947ba1 |
14 | 227d10584b |
15 | 129041bdc0 |
hex | a80c4069b |
45110003355 has 16 divisors (see below), whose sum is σ = 80195561760. Its totient is φ = 24058668384.
The previous prime is 45110003329. The next prime is 45110003359. The reversal of 45110003355 is 55330001154.
It is not a de Polignac number, because 45110003355 - 27 = 45110003227 is a prime.
It is a super-3 number, since 3×451100033553 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (45110003359) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167073952 + ... + 167074221.
It is an arithmetic number, because the mean of its divisors is an integer number (5012222610).
Almost surely, 245110003355 is an apocalyptic number.
45110003355 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
45110003355 is a deficient number, since it is larger than the sum of its proper divisors (35085558405).
45110003355 is a wasteful number, since it uses less digits than its factorization.
45110003355 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 334148187 (or 334148181 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 27.
The spelling of 45110003355 in words is "forty-five billion, one hundred ten million, three thousand, three hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •