Base | Representation |
---|---|
bin | 11101011001010101000… |
… | …11011000010000000001 |
3 | 10120120001210221210212012 |
4 | 32230222203120100001 |
5 | 113022020443411001 |
6 | 2052000230342305 |
7 | 132654341550251 |
oct | 16545243302001 |
9 | 3516053853765 |
10 | 1010031232001 |
11 | 35a396331a80 |
12 | 1439014ba995 |
13 | 7432659c98c |
14 | 36c587b9961 |
15 | 1b4172432bb |
hex | eb2a8d8401 |
1010031232001 has 4 divisors (see below), whose sum is σ = 1101852253104. Its totient is φ = 918210210900.
The previous prime is 1010031231973. The next prime is 1010031232003. The reversal of 1010031232001 is 1002321300101.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1010031232001 - 226 = 1009964123137 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1010031232003) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 45910510535 + ... + 45910510556.
It is an arithmetic number, because the mean of its divisors is an integer number (275463063276).
Almost surely, 21010031232001 is an apocalyptic number.
1010031232001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1010031232001 is a deficient number, since it is larger than the sum of its proper divisors (91821021103).
1010031232001 is an equidigital number, since it uses as much as digits as its factorization.
1010031232001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91821021102.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 1010031232001 its reverse (1002321300101), we get a palindrome (2012352532102).
The spelling of 1010031232001 in words is "one trillion, ten billion, thirty-one million, two hundred thirty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •