Base | Representation |
---|---|
bin | 101101010001101010100… |
… | …011100110110000110110 |
3 | 102000102220220201121111000 |
4 | 231101222203212300312 |
5 | 401434013033303024 |
6 | 10341155352424130 |
7 | 440534001663336 |
oct | 55215243466066 |
9 | 12012826647430 |
10 | 3111344041014 |
11 | a9a571664790 |
12 | 422bba9a8046 |
13 | 197524614a41 |
14 | aa8387c30c6 |
15 | 55dee82acc9 |
hex | 2d46a8e6c36 |
3111344041014 has 32 divisors (see below), whose sum is σ = 7542652222080. Its totient is φ = 942831527400.
The previous prime is 3111344040983. The next prime is 3111344041027. The reversal of 3111344041014 is 4101404431113.
3111344041014 is a `hidden beast` number, since 3 + 1 + 113 + 440 + 4 + 101 + 4 = 666.
3111344041014 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2618975872 + ... + 2618977059.
It is an arithmetic number, because the mean of its divisors is an integer number (235707881940).
Almost surely, 23111344041014 is an apocalyptic number.
3111344041014 is an abundant number, since it is smaller than the sum of its proper divisors (4431308181066).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3111344041014 is a wasteful number, since it uses less digits than its factorization.
3111344041014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5237952953 (or 5237952947 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
Adding to 3111344041014 its reverse (4101404431113), we get a palindrome (7212748472127).
The spelling of 3111344041014 in words is "three trillion, one hundred eleven billion, three hundred forty-four million, forty-one thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •