Base | Representation |
---|---|
bin | 101100100110100110111… |
… | …010011000110111101001 |
3 | 101212000120220222220021101 |
4 | 230212212322120313221 |
5 | 400204322133143441 |
6 | 10304032031441401 |
7 | 434306222114524 |
oct | 54464672306751 |
9 | 11760526886241 |
10 | 3065112006121 |
11 | a819a7902690 |
12 | 416057986261 |
13 | 1930673a4189 |
14 | a84d0685bbb |
15 | 54ae5b75231 |
hex | 2c9a6e98de9 |
3065112006121 has 16 divisors (see below), whose sum is σ = 3346338961728. Its totient is φ = 2784315889600.
The previous prime is 3065112006041. The next prime is 3065112006139. The reversal of 3065112006121 is 1216002115603.
It is a cyclic number.
It is not a de Polignac number, because 3065112006121 - 29 = 3065112005609 is a prime.
It is a super-2 number, since 2×30651120061212 (a number of 26 digits) contains 22 as substring.
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 3065112006121.
It is not an unprimeable number, because it can be changed into a prime (3065112006421) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 95419755 + ... + 95451871.
It is an arithmetic number, because the mean of its divisors is an integer number (209146185108).
Almost surely, 23065112006121 is an apocalyptic number.
It is an amenable number.
3065112006121 is a deficient number, since it is larger than the sum of its proper divisors (281226955607).
3065112006121 is a wasteful number, since it uses less digits than its factorization.
3065112006121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38552.
The product of its (nonzero) digits is 2160, while the sum is 28.
The spelling of 3065112006121 in words is "three trillion, sixty-five billion, one hundred twelve million, six thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •