Base | Representation |
---|---|
bin | 10110111111011000000000… |
… | …000011100101001100011010 |
3 | 111021000020001120012222020221 |
4 | 112333120000003211030122 |
5 | 101223110110440134320 |
6 | 555014133411510254 |
7 | 30204052421640115 |
oct | 2677300003451432 |
9 | 437006046188227 |
10 | 101112121021210 |
11 | 2a243456368872 |
12 | b4102588b838a |
13 | 4455aa8179700 |
14 | 1ad7bd1ddb57c |
15 | ba52594493aa |
hex | 5bf6000e531a |
101112121021210 has 48 divisors (see below), whose sum is σ = 197083117730304. Its totient is φ = 37332905628096.
The previous prime is 101112121021207. The next prime is 101112121021217. The reversal of 101112121021210 is 12120121211101.
It is a super-3 number, since 3×1011121210212103 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (101112121021217) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 81285199 + ... + 82519741.
It is an arithmetic number, because the mean of its divisors is an integer number (4105898286048).
Almost surely, 2101112121021210 is an apocalyptic number.
101112121021210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
101112121021210 is a deficient number, since it is larger than the sum of its proper divisors (95970996709094).
101112121021210 is a wasteful number, since it uses less digits than its factorization.
101112121021210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1283039 (or 1283026 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101112121021210 its reverse (12120121211101), we get a palindrome (113232242232311).
The spelling of 101112121021210 in words is "one hundred one trillion, one hundred twelve billion, one hundred twenty-one million, twenty-one thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •