Base | Representation |
---|---|
bin | 1010101111010… |
… | …0001000001111 |
3 | 10010202021110110 |
4 | 2223310020033 |
5 | 43012241033 |
6 | 4245211103 |
7 | 1054556241 |
oct | 253641017 |
9 | 103667413 |
10 | 45040143 |
11 | 23473365 |
12 | 13100a93 |
13 | 943c995 |
14 | 5da6091 |
15 | 3e4a363 |
hex | 2af420f |
45040143 has 8 divisors (see below), whose sum is σ = 61038256. Its totient is φ = 29534400.
The previous prime is 45040139. The next prime is 45040153. The reversal of 45040143 is 34104054.
45040143 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 45040143 - 22 = 45040139 is a prime.
It is a super-2 number, since 2×450401432 = 4057228962920898, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (45040153) 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 7 ways as a sum of consecutive naturals, for example, 122878 + ... + 123243.
It is an arithmetic number, because the mean of its divisors is an integer number (7629782).
Almost surely, 245040143 is an apocalyptic number.
45040143 is a deficient number, since it is larger than the sum of its proper divisors (15998113).
45040143 is a wasteful number, since it uses less digits than its factorization.
45040143 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246185.
The product of its (nonzero) digits is 960, while the sum is 21.
The square root of 45040143 is about 6711.1953480732. The cubic root of 45040143 is about 355.7950652129.
Adding to 45040143 its reverse (34104054), we get a palindrome (79144197).
The spelling of 45040143 in words is "forty-five million, forty thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •