Base | Representation |
---|---|
bin | 111110111000000000… |
… | …1011010101110110111 |
3 | 110220112000100201012011 |
4 | 1331300001122232313 |
5 | 4203011442443012 |
6 | 142010124105051 |
7 | 12520002004630 |
oct | 1756001325667 |
9 | 426460321164 |
10 | 135023406007 |
11 | 52299213446 |
12 | 22203095187 |
13 | c96a839c19 |
14 | 676c700887 |
15 | 37a3d901a7 |
hex | 1f7005abb7 |
135023406007 has 8 divisors (see below), whose sum is σ = 162434172800. Its totient is φ = 109643066424.
The previous prime is 135023405977. The next prime is 135023406019. The reversal of 135023406007 is 700604320531.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-135023406007 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 135023406007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (135023406097) 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, 507606657 + ... + 507606922.
It is an arithmetic number, because the mean of its divisors is an integer number (20304271600).
Almost surely, 2135023406007 is an apocalyptic number.
135023406007 is a deficient number, since it is larger than the sum of its proper divisors (27410766793).
135023406007 is a wasteful number, since it uses less digits than its factorization.
135023406007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015213605.
The product of its (nonzero) digits is 15120, while the sum is 31.
Adding to 135023406007 its reverse (700604320531), we get a palindrome (835627726538).
The spelling of 135023406007 in words is "one hundred thirty-five billion, twenty-three million, four hundred six thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •