Base | Representation |
---|---|
bin | 1101000111001111… |
… | …11110010111000001 |
3 | 200011122020210021211 |
4 | 12203213332113001 |
5 | 103404233220140 |
6 | 3122330250121 |
7 | 336314065525 |
oct | 64347762701 |
9 | 20148223254 |
10 | 7040132545 |
11 | 2a92a75866 |
12 | 1445886941 |
13 | 882717c04 |
14 | 4ab005d85 |
15 | 2b30e52ea |
hex | 1a39fe5c1 |
7040132545 has 8 divisors (see below), whose sum is σ = 8452117800. Its totient is φ = 5629466880.
The previous prime is 7040132389. The next prime is 7040132563. The reversal of 7040132545 is 5452310407.
7040132545 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 4320301441 + 2719831104 = 65729^2 + 52152^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-7040132545 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 318120 + ... + 339529.
It is an arithmetic number, because the mean of its divisors is an integer number (1056514725).
Almost surely, 27040132545 is an apocalyptic number.
It is an amenable number.
7040132545 is a deficient number, since it is larger than the sum of its proper divisors (1411985255).
7040132545 is a wasteful number, since it uses less digits than its factorization.
7040132545 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 659795.
The product of its (nonzero) digits is 16800, while the sum is 31.
The square root of 7040132545 is about 83905.4977042625. The cubic root of 7040132545 is about 1916.5799707562.
The spelling of 7040132545 in words is "seven billion, forty million, one hundred thirty-two thousand, five hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •