Base | Representation |
---|---|
bin | 100011011010000010000100… |
… | …0001000101110101100101001 |
3 | 1111211201110220202011001020010 |
4 | 1012310010020020232230221 |
5 | 311310122333102303001 |
6 | 3022214022144322133 |
7 | 122412606535312020 |
oct | 10664041010565451 |
9 | 1454643822131203 |
10 | 311441100041001 |
11 | 902644797a1967 |
12 | 2ab1b456313349 |
13 | 104a1a010b2c98 |
14 | 56c9b8888b8b7 |
15 | 260146ec8b8d6 |
hex | 11b410822eb29 |
311441100041001 has 16 divisors (see below), whose sum is σ = 495210693233664. Its totient is φ = 170228675798544.
The previous prime is 311441100040957. The next prime is 311441100041063. The reversal of 311441100041001 is 100140001144113.
It is not a de Polignac number, because 311441100041001 - 218 = 311441099778857 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (311441100041801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 322402794591 + ... + 322402795556.
It is an arithmetic number, because the mean of its divisors is an integer number (30950668327104).
Almost surely, 2311441100041001 is an apocalyptic number.
It is an amenable number.
311441100041001 is a deficient number, since it is larger than the sum of its proper divisors (183769593192663).
311441100041001 is a wasteful number, since it uses less digits than its factorization.
311441100041001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 644805590180.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 311441100041001 its reverse (100140001144113), we get a palindrome (411581101185114).
The spelling of 311441100041001 in words is "three hundred eleven trillion, four hundred forty-one billion, one hundred million, forty-one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •