Base | Representation |
---|---|
bin | 100111010101101… |
… | …1100010011111001 |
3 | 10101222211111200100 |
4 | 1032223130103321 |
5 | 10200410323001 |
6 | 334552230013 |
7 | 44465623401 |
oct | 11653342371 |
9 | 3358744610 |
10 | 1320011001 |
11 | 618125891 |
12 | 30a09b309 |
13 | 1806233ca |
14 | c744d801 |
15 | 7ad44586 |
hex | 4eadc4f9 |
1320011001 has 48 divisors (see below), whose sum is σ = 2000771136. Its totient is φ = 837848448.
The previous prime is 1320010999. The next prime is 1320011003. The reversal of 1320011001 is 1001100231.
It is an interprime number because it is at equal distance from previous prime (1320010999) and next prime (1320011003).
It is not a de Polignac number, because 1320011001 - 21 = 1320010999 is a prime.
It is a super-2 number, since 2×13200110012 = 3484858085522044002, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (1320011003) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4505011 + ... + 4505303.
It is an arithmetic number, because the mean of its divisors is an integer number (41682732).
Almost surely, 21320011001 is an apocalyptic number.
It is an amenable number.
1320011001 is a deficient number, since it is larger than the sum of its proper divisors (680760135).
1320011001 is a wasteful number, since it uses less digits than its factorization.
1320011001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 582 (or 579 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
The square root of 1320011001 is about 36331.9556451342. The cubic root of 1320011001 is about 1096.9643578698.
Adding to 1320011001 its reverse (1001100231), we get a palindrome (2321111232).
The spelling of 1320011001 in words is "one billion, three hundred twenty million, eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •