Base | Representation |
---|---|
bin | 101100011001011101100… |
… | …011010010011001100101 |
3 | 101210200011011211022201120 |
4 | 230121131203102121211 |
5 | 344441420023433103 |
6 | 10253335223244153 |
7 | 433266350516403 |
oct | 54313543223145 |
9 | 11720134738646 |
10 | 3050996311653 |
11 | a76a13973494 |
12 | 4133785a9659 |
13 | 191927b18044 |
14 | a7951a94473 |
15 | 5456b7dc253 |
hex | 2c65d8d2665 |
3050996311653 has 8 divisors (see below), whose sum is σ = 4084874730816. Its totient is φ = 2025557716800.
The previous prime is 3050996311589. The next prime is 3050996311663. The reversal of 3050996311653 is 3561136990503.
It is a happy number.
3050996311653 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 3050996311653 - 26 = 3050996311589 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3050996311596 and 3050996311605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3050996311663) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2109955233 + ... + 2109956678.
It is an arithmetic number, because the mean of its divisors is an integer number (510609341352).
Almost surely, 23050996311653 is an apocalyptic number.
It is an amenable number.
3050996311653 is a deficient number, since it is larger than the sum of its proper divisors (1033878419163).
3050996311653 is a wasteful number, since it uses less digits than its factorization.
3050996311653 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4219912155.
The product of its (nonzero) digits is 1968300, while the sum is 51.
The spelling of 3050996311653 in words is "three trillion, fifty billion, nine hundred ninety-six million, three hundred eleven thousand, six hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •