Base | Representation |
---|---|
bin | 10111000000110011001010… |
… | …110100011111001110100101 |
3 | 111021100120201202121000212102 |
4 | 113000303022310133032211 |
5 | 101231211101100314343 |
6 | 555131123201501445 |
7 | 30214116310356401 |
oct | 2700631264371645 |
9 | 437316652530772 |
10 | 101210012119973 |
11 | 2a280a1a336189 |
12 | b427218341885 |
13 | 44620a8aa28a3 |
14 | 1adc83ad36101 |
15 | ba7a8845e3b8 |
hex | 5c0ccad1f3a5 |
101210012119973 has 4 divisors (see below), whose sum is σ = 101391717707820. Its totient is φ = 101028306532128.
The previous prime is 101210012119969. The next prime is 101210012120003. The reversal of 101210012119973 is 379911210012101.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5625425752804 + 95584586367169 = 2371798^2 + 9776737^2 .
It is a cyclic number.
It is not a de Polignac number, because 101210012119973 - 22 = 101210012119969 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101210012112973) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 90852793088 + ... + 90852794201.
It is an arithmetic number, because the mean of its divisors is an integer number (25347929426955).
Almost surely, 2101210012119973 is an apocalyptic number.
It is an amenable number.
101210012119973 is a deficient number, since it is larger than the sum of its proper divisors (181705587847).
101210012119973 is an equidigital number, since it uses as much as digits as its factorization.
101210012119973 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 181705587846.
The product of its (nonzero) digits is 6804, while the sum is 38.
The spelling of 101210012119973 in words is "one hundred one trillion, two hundred ten billion, twelve million, one hundred nineteen thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •