Base | Representation |
---|---|
bin | 10111000000101001110110… |
… | …000011010010000000000011 |
3 | 111021022121220000000122021021 |
4 | 113000221312003102000003 |
5 | 101231030100000000003 |
6 | 555122345503210311 |
7 | 30213313224635302 |
oct | 2700516603220003 |
9 | 437277800018237 |
10 | 101200000000003 |
11 | 2a2777517a3273 |
12 | b4252a32a6997 |
13 | 4461171730948 |
14 | 1adc16b33a439 |
15 | ba769e4aa2bd |
hex | 5c0a760d2003 |
101200000000003 has 4 divisors (see below), whose sum is σ = 101467018470040. Its totient is φ = 100932981529968.
The previous prime is 101199999999983. The next prime is 101200000000079. The reversal of 101200000000003 is 300000000002101.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 101200000000003 - 245 = 66015627911171 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101200000000403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133509234450 + ... + 133509235207.
It is an arithmetic number, because the mean of its divisors is an integer number (25366754617510).
Almost surely, 2101200000000003 is an apocalyptic number.
101200000000003 is a deficient number, since it is larger than the sum of its proper divisors (267018470037).
101200000000003 is an equidigital number, since it uses as much as digits as its factorization.
101200000000003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 267018470036.
The product of its (nonzero) digits is 6, while the sum is 7.
Adding to 101200000000003 its reverse (300000000002101), we get a palindrome (401200000002104).
The spelling of 101200000000003 in words is "one hundred one trillion, two hundred billion, three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •