Base | Representation |
---|---|
bin | 11101001000111100000… |
… | …01010010001011001001 |
3 | 10112201100111211101100002 |
4 | 32210132001102023021 |
5 | 112401010121024113 |
6 | 2043543103452345 |
7 | 132223303234430 |
oct | 16443601221311 |
9 | 3481314741302 |
10 | 1001231033033 |
11 | 35668a8a8270 |
12 | 1420662b70b5 |
13 | 7355333725a |
14 | 36661b34117 |
15 | 1b09e881c58 |
hex | e91e0522c9 |
1001231033033 has 16 divisors (see below), whose sum is σ = 1250344587264. Its totient is φ = 778894684560.
The previous prime is 1001231033027. The next prime is 1001231033053. The reversal of 1001231033033 is 3303301321001.
It is a cyclic number.
It is not a de Polignac number, because 1001231033033 - 28 = 1001231032777 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1001231032996 and 1001231033014.
It is not an unprimeable number, because it can be changed into a prime (1001231033053) 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 15 ways as a sum of consecutive naturals, for example, 10664135 + ... + 10757612.
It is an arithmetic number, because the mean of its divisors is an integer number (78146536704).
Almost surely, 21001231033033 is an apocalyptic number.
It is an amenable number.
1001231033033 is a deficient number, since it is larger than the sum of its proper divisors (249113554231).
1001231033033 is a wasteful number, since it uses less digits than its factorization.
1001231033033 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21422372.
The product of its (nonzero) digits is 486, while the sum is 20.
Adding to 1001231033033 its reverse (3303301321001), we get a palindrome (4304532354034).
The spelling of 1001231033033 in words is "one trillion, one billion, two hundred thirty-one million, thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •