Base | Representation |
---|---|
bin | 101100100101111111101… |
… | …110110001110011111011 |
3 | 101211221220010001210202021 |
4 | 230211333232301303323 |
5 | 400202000342314011 |
6 | 10303442510215311 |
7 | 434254020515626 |
oct | 54457756616373 |
9 | 11757803053667 |
10 | 3064454651131 |
11 | a8169a8400a5 |
12 | 415ab37b4537 |
13 | 192c91146523 |
14 | a846b24cdbd |
15 | 54aa80c8471 |
hex | 2c97fbb1cfb |
3064454651131 has 8 divisors (see below), whose sum is σ = 3170176783200. Its totient is φ = 2958735937920.
The previous prime is 3064454651087. The next prime is 3064454651143. The reversal of 3064454651131 is 1311564544603.
3064454651131 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 3064454651131 - 27 = 3064454651003 is a prime.
It is a super-3 number, since 3×30644546511313 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (3064454651161) 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, 1040115 + ... + 2685283.
It is an arithmetic number, because the mean of its divisors is an integer number (396272097900).
Almost surely, 23064454651131 is an apocalyptic number.
3064454651131 is a deficient number, since it is larger than the sum of its proper divisors (105722132069).
3064454651131 is a wasteful number, since it uses less digits than its factorization.
3064454651131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1709429.
The product of its (nonzero) digits is 518400, while the sum is 43.
The spelling of 3064454651131 in words is "three trillion, sixty-four billion, four hundred fifty-four million, six hundred fifty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •