Base | Representation |
---|---|
bin | 101111000010101000… |
… | …0101110011110100101 |
3 | 100122202020221211020110 |
4 | 1132011100232132211 |
5 | 3123342110032323 |
6 | 114224041123233 |
7 | 10204240564614 |
oct | 1360520563645 |
9 | 318666854213 |
10 | 101020002213 |
11 | 3992a180939 |
12 | 176b3489519 |
13 | 96abc31050 |
14 | 4c646d787b |
15 | 2963a6c793 |
hex | 178542e7a5 |
101020002213 has 32 divisors (see below), whose sum is σ = 149297000832. Its totient is φ = 60362265600.
The previous prime is 101020002191. The next prime is 101020002229. The reversal of 101020002213 is 312200020101.
It is not a de Polignac number, because 101020002213 - 210 = 101020001189 is a prime.
It is a super-2 number, since 2×1010200022132 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101020002113) 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 31 ways as a sum of consecutive naturals, for example, 187681 + ... + 487097.
It is an arithmetic number, because the mean of its divisors is an integer number (4665531276).
Almost surely, 2101020002213 is an apocalyptic number.
101020002213 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
101020002213 is a deficient number, since it is larger than the sum of its proper divisors (48276998619).
101020002213 is a wasteful number, since it uses less digits than its factorization.
101020002213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 299685.
The product of its (nonzero) digits is 24, while the sum is 12.
Adding to 101020002213 its reverse (312200020101), we get a palindrome (413220022314).
The spelling of 101020002213 in words is "one hundred one billion, twenty million, two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •