Base | Representation |
---|---|
bin | 1011011010100111… |
… | …1010110100010011 |
3 | 21220120021210022201 |
4 | 2312221322310103 |
5 | 22233444122011 |
6 | 1224025344031 |
7 | 135640220422 |
oct | 26651726423 |
9 | 7816253281 |
10 | 3064442131 |
11 | 1332885803 |
12 | 716338017 |
13 | 39ab5838a |
14 | 210dbd2b9 |
15 | 12e072cc1 |
hex | b6a7ad13 |
3064442131 has 8 divisors (see below), whose sum is σ = 3139912944. Its totient is φ = 2989006080.
The previous prime is 3064442119. The next prime is 3064442179. The reversal of 3064442131 is 1312444603.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3064442131 - 215 = 3064409363 is a prime.
It is a super-2 number, since 2×30644421312 = 18781611148495642322, which contains 22 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 3064442131.
It is not an unprimeable number, because it can be changed into a prime (3064440131) 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, 324036 + ... + 333358.
It is an arithmetic number, because the mean of its divisors is an integer number (392489118).
Almost surely, 23064442131 is an apocalyptic number.
3064442131 is a deficient number, since it is larger than the sum of its proper divisors (75470813).
3064442131 is an equidigital number, since it uses as much as digits as its factorization.
3064442131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17381.
The product of its (nonzero) digits is 6912, while the sum is 28.
The square root of 3064442131 is about 55357.4035789252. The cubic root of 3064442131 is about 1452.5033460147.
Adding to 3064442131 its reverse (1312444603), we get a palindrome (4376886734).
The spelling of 3064442131 in words is "three billion, sixty-four million, four hundred forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •