Base | Representation |
---|---|
bin | 111100111100110… |
… | …1001000010011001 |
3 | 12021112022120002110 |
4 | 1321321221002121 |
5 | 13142024402213 |
6 | 534534422533 |
7 | 101452342311 |
oct | 17171510231 |
9 | 5245276073 |
10 | 2045153433 |
11 | 95a488054 |
12 | 490b01a49 |
13 | 26792677b |
14 | 155890441 |
15 | be8315c3 |
hex | 79e69099 |
2045153433 has 8 divisors (see below), whose sum is σ = 2727203296. Its totient is φ = 1363269600.
The previous prime is 2045153423. The next prime is 2045153437. The reversal of 2045153433 is 3343515402.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2045153433 - 24 = 2045153417 is a prime.
It is a super-3 number, since 3×20451534333 (a number of 29 digits) contains 333 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2045153433.
It is not an unprimeable number, because it can be changed into a prime (2045153437) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9163 + ... + 64608.
It is an arithmetic number, because the mean of its divisors is an integer number (340900412).
Almost surely, 22045153433 is an apocalyptic number.
It is an amenable number.
2045153433 is a deficient number, since it is larger than the sum of its proper divisors (682049863).
2045153433 is an equidigital number, since it uses as much as digits as its factorization.
2045153433 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 83015.
The product of its (nonzero) digits is 21600, while the sum is 30.
The square root of 2045153433 is about 45223.3726407043. The cubic root of 2045153433 is about 1269.3322037368.
Adding to 2045153433 its reverse (3343515402), we get a palindrome (5388668835).
The spelling of 2045153433 in words is "two billion, forty-five million, one hundred fifty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •