Base | Representation |
---|---|
bin | 10100011111011110… |
… | …01000001001001010 |
3 | 1001101201010120122200 |
4 | 22033233020021022 |
5 | 140012331234402 |
6 | 5015354501030 |
7 | 536424421461 |
oct | 121757101112 |
9 | 31351116580 |
10 | 11001430602 |
11 | 4736025708 |
12 | 2170434776 |
13 | 1064308866 |
14 | 7651639d8 |
15 | 445c7321c |
hex | 28fbc824a |
11001430602 has 12 divisors (see below), whose sum is σ = 23836433010. Its totient is φ = 3667143528.
The previous prime is 11001430571. The next prime is 11001430607. The reversal of 11001430602 is 20603410011.
It is a happy number.
11001430602 is digitally balanced in base 5, 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 only one way, i.e., 10704178521 + 297252081 = 103461^2 + 17241^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 611190589 = 11001430602 / (1 + 1 + 0 + 0 + 1 + 4 + 3 + 0 + 6 + 0 + 2).
It is not an unprimeable number, because it can be changed into a prime (11001430607) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 305595277 + ... + 305595312.
Almost surely, 211001430602 is an apocalyptic number.
11001430602 is an abundant number, since it is smaller than the sum of its proper divisors (12835002408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11001430602 is a wasteful number, since it uses less digits than its factorization.
11001430602 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 611190597 (or 611190594 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 11001430602 its reverse (20603410011), we get a palindrome (31604840613).
The spelling of 11001430602 in words is "eleven billion, one million, four hundred thirty thousand, six hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •