Base | Representation |
---|---|
bin | 1011010100111111… |
… | …1101110010101001 |
3 | 21211220220202120120 |
4 | 2311033331302221 |
5 | 22211430030403 |
6 | 1221424113453 |
7 | 135232615665 |
oct | 26517756251 |
9 | 7756822516 |
10 | 3040861353 |
11 | 132053a162 |
12 | 70a465889 |
13 | 395cc015a |
14 | 20bc018a5 |
15 | 12be65e53 |
hex | b53fdca9 |
3040861353 has 4 divisors (see below), whose sum is σ = 4054481808. Its totient is φ = 2027240900.
The previous prime is 3040861339. The next prime is 3040861367. The reversal of 3040861353 is 3531680403.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 3531680403 = 3 ⋅1177226801.
It is an interprime number because it is at equal distance from previous prime (3040861339) and next prime (3040861367).
It is a cyclic number.
It is not a de Polignac number, because 3040861353 - 25 = 3040861321 is a prime.
It is not an unprimeable number, because it can be changed into a prime (3040861253) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 506810223 + ... + 506810228.
It is an arithmetic number, because the mean of its divisors is an integer number (1013620452).
Almost surely, 23040861353 is an apocalyptic number.
It is an amenable number.
3040861353 is a deficient number, since it is larger than the sum of its proper divisors (1013620455).
3040861353 is a wasteful number, since it uses less digits than its factorization.
3040861353 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1013620454.
The product of its (nonzero) digits is 25920, while the sum is 33.
The square root of 3040861353 is about 55144.0055944434. The cubic root of 3040861353 is about 1448.7680940695.
The spelling of 3040861353 in words is "three billion, forty million, eight hundred sixty-one thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •