Base | Representation |
---|---|
bin | 1010010010011101100110… |
… | …1001000111000010111001 |
3 | 1111001110000122210212010002 |
4 | 2210213121221013002321 |
5 | 2440320042340314001 |
6 | 40020444331202345 |
7 | 2245200230135666 |
oct | 244473151070271 |
9 | 44043018725102 |
10 | 11312300323001 |
11 | 3671579691a07 |
12 | 13284965a63b5 |
13 | 64098c6992a2 |
14 | 2b1738150a6d |
15 | 1493d3b5d46b |
hex | a49d9a470b9 |
11312300323001 has 4 divisors (see below), whose sum is σ = 11312406850932. Its totient is φ = 11312193795072.
The previous prime is 11312300322989. The next prime is 11312300323003. The reversal of 11312300323001 is 10032300321311.
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 4677163155625 + 6635137167376 = 2162675^2 + 2575876^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11312300323001 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11312300323003) 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, 53104520 + ... + 53317113.
It is an arithmetic number, because the mean of its divisors is an integer number (2828101712733).
Almost surely, 211312300323001 is an apocalyptic number.
It is an amenable number.
11312300323001 is a deficient number, since it is larger than the sum of its proper divisors (106527931).
11312300323001 is a wasteful number, since it uses less digits than its factorization.
11312300323001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 106527930.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 11312300323001 its reverse (10032300321311), we get a palindrome (21344600644312).
The spelling of 11312300323001 in words is "eleven trillion, three hundred twelve billion, three hundred million, three hundred twenty-three thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •