Base | Representation |
---|---|
bin | 11101011101000000111… |
… | …11110111000101011010 |
3 | 10120202011201101201100102 |
4 | 32232200133313011122 |
5 | 113040044031134320 |
6 | 2052524434535402 |
7 | 133054360151066 |
oct | 16564037670532 |
9 | 3522151351312 |
10 | 1012010021210 |
11 | 360211301661 |
12 | 144174137562 |
13 | 7458052b776 |
14 | 36da5512aa6 |
15 | 1b4d0d16175 |
hex | eba07f715a |
1012010021210 has 8 divisors (see below), whose sum is σ = 1821618038196. Its totient is φ = 404804008480.
The previous prime is 1012010021189. The next prime is 1012010021219. The reversal of 1012010021210 is 121200102101.
It can be written as a sum of positive squares in 2 ways, for example, as 1000062000961 + 11948020249 = 1000031^2 + 109307^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 1012010021191 and 1012010021200.
It is not an unprimeable number, because it can be changed into a prime (1012010021219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50600501051 + ... + 50600501070.
Almost surely, 21012010021210 is an apocalyptic number.
1012010021210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1012010021210 is a deficient number, since it is larger than the sum of its proper divisors (809608016986).
1012010021210 is a wasteful number, since it uses less digits than its factorization.
1012010021210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101201002128.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1012010021210 its reverse (121200102101), we get a palindrome (1133210123311).
The spelling of 1012010021210 in words is "one trillion, twelve billion, ten million, twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •