Base | Representation |
---|---|
bin | 1010010001111000000000… |
… | …1110000011000110001011 |
3 | 1111000110222110022112122110 |
4 | 2210132000032003012023 |
5 | 2440133411242401443 |
6 | 40012055203153403 |
7 | 2244362205633504 |
oct | 244360016030613 |
9 | 44013873275573 |
10 | 11302210122123 |
11 | 3668270a69718 |
12 | 132653b375863 |
13 | 63ca420b961b |
14 | 2b105c02bbab |
15 | 148ee2dd4233 |
hex | a478038318b |
11302210122123 has 16 divisors (see below), whose sum is σ = 15085686404096. Its totient is φ = 7526774417760.
The previous prime is 11302210122107. The next prime is 11302210122131. The reversal of 11302210122123 is 32122101220311.
It is not a de Polignac number, because 11302210122123 - 24 = 11302210122107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11302210122123.
It is not an unprimeable number, because it can be changed into a prime (11302210122523) 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 15 ways as a sum of consecutive naturals, for example, 10491540 + ... + 11518542.
It is an arithmetic number, because the mean of its divisors is an integer number (942855400256).
Almost surely, 211302210122123 is an apocalyptic number.
11302210122123 is a deficient number, since it is larger than the sum of its proper divisors (3783476281973).
11302210122123 is a wasteful number, since it uses less digits than its factorization.
11302210122123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1030914.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 11302210122123 its reverse (32122101220311), we get a palindrome (43424311342434).
The spelling of 11302210122123 in words is "eleven trillion, three hundred two billion, two hundred ten million, one hundred twenty-two thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •