Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …110000010010111011010010 |
3 | 111021100120201200112012101002 |
4 | 113000303022300102323102 |
5 | 101231211100310133020 |
6 | 555131123122142002 |
7 | 30214116265131413 |
oct | 2700631260227322 |
9 | 437316650465332 |
10 | 101210011021010 |
11 | 2a280a19755551 |
12 | b427217ab1902 |
13 | 44620a87a9608 |
14 | 1adc83ab2b80a |
15 | ba7a882e3975 |
hex | 5c0ccac12ed2 |
101210011021010 has 16 divisors (see below), whose sum is σ = 182493752984856. Its totient is φ = 40413841486848.
The previous prime is 101210011020863. The next prime is 101210011021013. The reversal of 101210011021010 is 10120110012101.
It can be written as a sum of positive squares in 4 ways, for example, as 95601246652921 + 5608764368089 = 9777589^2 + 2368283^2 .
It is a super-2 number, since 2×1012100110210102 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101210011020982 and 101210011021000.
It is not an unprimeable number, because it can be changed into a prime (101210011021013) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 8770359137 + ... + 8770370676.
Almost surely, 2101210011021010 is an apocalyptic number.
101210011021010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101210011021010 is a deficient number, since it is larger than the sum of its proper divisors (81283741963846).
101210011021010 is a wasteful number, since it uses less digits than its factorization.
101210011021010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17540730397.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 101210011021010 its reverse (10120110012101), we get a palindrome (111330121033111).
The spelling of 101210011021010 in words is "one hundred one trillion, two hundred ten billion, eleven million, twenty-one thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •