Base | Representation |
---|---|
bin | 110111111001010010… |
… | …1110111101010101110 |
3 | 102110211101101121212222 |
4 | 1233302211313222232 |
5 | 3431312214134411 |
6 | 131050511555342 |
7 | 11446362163355 |
oct | 1576245675256 |
9 | 373741347788 |
10 | 120034130606 |
11 | 469a7156a35 |
12 | 1b31b22bb52 |
13 | b41c2a74b0 |
14 | 5b49aac99c |
15 | 31c7e984db |
hex | 1bf2977aae |
120034130606 has 8 divisors (see below), whose sum is σ = 193901287944. Its totient is φ = 55400367960.
The previous prime is 120034130603. The next prime is 120034130609. The reversal of 120034130606 is 606031430021.
It is an interprime number because it is at equal distance from previous prime (120034130603) and next prime (120034130609).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (26), and also a Moran number because the ratio is a prime number: 4616697331 = 120034130606 / (1 + 2 + 0 + 0 + 3 + 4 + 1 + 3 + 0 + 6 + 0 + 6).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120034130603) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2308348640 + ... + 2308348691.
It is an arithmetic number, because the mean of its divisors is an integer number (24237660993).
Almost surely, 2120034130606 is an apocalyptic number.
120034130606 is a deficient number, since it is larger than the sum of its proper divisors (73867157338).
120034130606 is a wasteful number, since it uses less digits than its factorization.
120034130606 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4616697346.
The product of its (nonzero) digits is 2592, while the sum is 26.
Adding to 120034130606 its reverse (606031430021), we get a palindrome (726065560627).
The spelling of 120034130606 in words is "one hundred twenty billion, thirty-four million, one hundred thirty thousand, six hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •