Base | Representation |
---|---|
bin | 11101011101000000000… |
… | …01101001101011110001 |
3 | 10120202011011111101020101 |
4 | 32232200001221223301 |
5 | 113040040014231001 |
6 | 2052523553112401 |
7 | 133054232636032 |
oct | 16564001515361 |
9 | 3522134441211 |
10 | 1012002102001 |
11 | 360207892860 |
12 | 144171558701 |
13 | 7457b9b8047 |
14 | 36da4450a89 |
15 | 1b4d029ea01 |
hex | eba0069af1 |
1012002102001 has 8 divisors (see below), whose sum is σ = 1107484953984. Its totient is φ = 917099693520.
The previous prime is 1012002101983. The next prime is 1012002102029. The reversal of 1012002102001 is 1002012002101.
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 1012002102001 - 217 = 1012001970929 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1012002100001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 145107225 + ... + 145114198.
It is an arithmetic number, because the mean of its divisors is an integer number (138435619248).
Almost surely, 21012002102001 is an apocalyptic number.
1012002102001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1012002102001 is a deficient number, since it is larger than the sum of its proper divisors (95482851983).
1012002102001 is a wasteful number, since it uses less digits than its factorization.
1012002102001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 290221751.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 1012002102001 its reverse (1002012002101), we get a palindrome (2014014104102).
The spelling of 1012002102001 in words is "one trillion, twelve billion, two million, one hundred two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •