Base | Representation |
---|---|
bin | 1011011001011010… |
… | …1100000101011101 |
3 | 21220012210200021010 |
4 | 2312112230011131 |
5 | 22231201313203 |
6 | 1223325325433 |
7 | 135546323412 |
oct | 26626540535 |
9 | 7805720233 |
10 | 3059401053 |
11 | 132aa52325 |
12 | 714706879 |
13 | 399ab19a7 |
14 | 21046a109 |
15 | 12d8c9303 |
hex | b65ac15d |
3059401053 has 4 divisors (see below), whose sum is σ = 4079201408. Its totient is φ = 2039600700.
The previous prime is 3059401043. The next prime is 3059401061. The reversal of 3059401053 is 3501049503.
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.
It is not a de Polignac number, because 3059401053 - 221 = 3057303901 is a prime.
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 3059401053.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3059401043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 509900173 + ... + 509900178.
It is an arithmetic number, because the mean of its divisors is an integer number (1019800352).
Almost surely, 23059401053 is an apocalyptic number.
It is an amenable number.
3059401053 is a deficient number, since it is larger than the sum of its proper divisors (1019800355).
3059401053 is a wasteful number, since it uses less digits than its factorization.
3059401053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1019800354.
The product of its (nonzero) digits is 8100, while the sum is 30.
The square root of 3059401053 is about 55311.8527351959. The cubic root of 3059401053 is about 1451.7064417087.
The spelling of 3059401053 in words is "three billion, fifty-nine million, four hundred one thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •