Base | Representation |
---|---|
bin | 1011011000000110… |
… | …0101000010001001 |
3 | 21212211101112011120 |
4 | 2312001211002021 |
5 | 22223242222040 |
6 | 1223010545453 |
7 | 135451304520 |
oct | 26601450211 |
9 | 7784345146 |
10 | 3053867145 |
11 | 132791264a |
12 | 712898289 |
13 | 3988c4ba4 |
14 | 20d8294b7 |
15 | 12d1847d0 |
hex | b6065089 |
3053867145 has 24 divisors (see below), whose sum is σ = 5585249856. Its totient is φ = 1395794688.
The previous prime is 3053867143. The next prime is 3053867161. The reversal of 3053867145 is 5417683503.
It is not a de Polignac number, because 3053867145 - 21 = 3053867143 is a prime.
It is a super-2 number, since 2×30538671452 = 18652209078620902050, which contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 3053867097 and 3053867106.
It is not an unprimeable number, because it can be changed into a prime (3053867143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 563569 + ... + 568961.
It is an arithmetic number, because the mean of its divisors is an integer number (232718744).
Almost surely, 23053867145 is an apocalyptic number.
3053867145 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
3053867145 is a deficient number, since it is larger than the sum of its proper divisors (2531382711).
3053867145 is an frugal number, since it uses more digits than its factorization.
3053867145 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10801 (or 5408 counting only the distinct ones).
The product of its (nonzero) digits is 302400, while the sum is 42.
The square root of 3053867145 is about 55261.8054808201. The cubic root of 3053867145 is about 1450.8306212009.
The spelling of 3053867145 in words is "three billion, fifty-three million, eight hundred sixty-seven thousand, one hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •