Base | Representation |
---|---|
bin | 11101011001010011111… |
… | …00101110110111001001 |
3 | 10120120001002220002201222 |
4 | 32230221330232313021 |
5 | 113022010400213001 |
6 | 2051555225251425 |
7 | 132654156463643 |
oct | 16545174566711 |
9 | 3516032802658 |
10 | 1010021101001 |
11 | 35a390642450 |
12 | 1438ba033b75 |
13 | 743244635c3 |
14 | 36c572dd893 |
15 | 1b4163e161b |
hex | eb29f2edc9 |
1010021101001 has 16 divisors (see below), whose sum is σ = 1107362784960. Its totient is φ = 913604566080.
The previous prime is 1010021100961. The next prime is 1010021101007. The reversal of 1010021101001 is 1001011200101.
It is a happy number.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1010021101001 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1010021101001.
It is not an unprimeable number, because it can be changed into a prime (1010021101007) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4046315 + ... + 4288671.
It is an arithmetic number, because the mean of its divisors is an integer number (69210174060).
Almost surely, 21010021101001 is an apocalyptic number.
1010021101001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1010021101001 is a deficient number, since it is larger than the sum of its proper divisors (97341683959).
1010021101001 is a wasteful number, since it uses less digits than its factorization.
1010021101001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 244264.
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 1010021101001 its reverse (1001011200101), we get a palindrome (2011032301102).
The spelling of 1010021101001 in words is "one trillion, ten billion, twenty-one million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •