Base | Representation |
---|---|
bin | 100111101110111… |
… | …0101001010100001 |
3 | 10102220200121000120 |
4 | 1033131311022201 |
5 | 10212301020001 |
6 | 340143310453 |
7 | 45016116531 |
oct | 11735651241 |
9 | 3386617016 |
10 | 1333220001 |
11 | 624627a13 |
12 | 3125ab429 |
13 | 183299799 |
14 | c90cb4c1 |
15 | 7c0a3236 |
hex | 4f7752a1 |
1333220001 has 64 divisors (see below), whose sum is σ = 2000388096. Its totient is φ = 786931200.
The previous prime is 1333219999. The next prime is 1333220003. The reversal of 1333220001 is 1000223331.
It is an interprime number because it is at equal distance from previous prime (1333219999) and next prime (1333220003).
It is not a de Polignac number, because 1333220001 - 21 = 1333219999 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1333220003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 4919496 + ... + 4919766.
It is an arithmetic number, because the mean of its divisors is an integer number (31256064).
Almost surely, 21333220001 is an apocalyptic number.
It is an amenable number.
1333220001 is a deficient number, since it is larger than the sum of its proper divisors (667168095).
1333220001 is a wasteful number, since it uses less digits than its factorization.
1333220001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422.
The product of its (nonzero) digits is 108, while the sum is 15.
The square root of 1333220001 is about 36513.2852671463. The cubic root of 1333220001 is about 1100.6112308213.
Adding to 1333220001 its reverse (1000223331), we get a palindrome (2333443332).
It can be divided in two parts, 13332 and 20001, that added together give a palindrome (33333).
The spelling of 1333220001 in words is "one billion, three hundred thirty-three million, two hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •