Base | Representation |
---|---|
bin | 11110000010010000001… |
… | …00001010001101110011 |
3 | 10122122202221022212120010 |
4 | 33001020010022031303 |
5 | 113402014301413021 |
6 | 2110032251150003 |
7 | 134362644321114 |
oct | 17011004121563 |
9 | 3578687285503 |
10 | 1032001201011 |
11 | 36873a856960 |
12 | 148013145303 |
13 | 76418138841 |
14 | 37d4058020b |
15 | 1bca0ddd976 |
hex | f04810a373 |
1032001201011 has 8 divisors (see below), whose sum is σ = 1501092656064. Its totient is φ = 625455273320.
The previous prime is 1032001200991. The next prime is 1032001201031. The reversal of 1032001201011 is 1101021002301.
It is an interprime number because it is at equal distance from previous prime (1032001200991) and next prime (1032001201031).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1032001201011 - 27 = 1032001200883 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1032001201031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15636381801 + ... + 15636381866.
It is an arithmetic number, because the mean of its divisors is an integer number (187636582008).
Almost surely, 21032001201011 is an apocalyptic number.
1032001201011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1032001201011 is a deficient number, since it is larger than the sum of its proper divisors (469091455053).
1032001201011 is a wasteful number, since it uses less digits than its factorization.
1032001201011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31272763681.
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1032001201011 its reverse (1101021002301), we get a palindrome (2133022203312).
The spelling of 1032001201011 in words is "one trillion, thirty-two billion, one million, two hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •