Base | Representation |
---|---|
bin | 101101001100000000100… |
… | …001111010111001000010 |
3 | 101222212020121210220102100 |
4 | 231030000201322321002 |
5 | 401334043140400403 |
6 | 10334312542131230 |
7 | 440230330410114 |
oct | 55140041727102 |
9 | 11885217726370 |
10 | 3105270246978 |
11 | a97a35111399 |
12 | 4219a4880b16 |
13 | 196a9717c583 |
14 | aa41dc853b4 |
15 | 55b964b82a3 |
hex | 2d30087ae42 |
3105270246978 has 48 divisors (see below), whose sum is σ = 6758966672640. Its totient is φ = 1030340116512.
The previous prime is 3105270246971. The next prime is 3105270247031. The reversal of 3105270246978 is 8796420725013.
It is a happy number.
3105270246978 is a `hidden beast` number, since 3 + 1 + 0 + 527 + 0 + 2 + 46 + 9 + 78 = 666.
It is not an unprimeable number, because it can be changed into a prime (3105270246971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 44130888 + ... + 44201196.
It is an arithmetic number, because the mean of its divisors is an integer number (140811805680).
It is a 1-persistent number, because it is pandigital, but 2⋅3105270246978 = 6210540493956 is not.
Almost surely, 23105270246978 is an apocalyptic number.
3105270246978 is an abundant number, since it is smaller than the sum of its proper divisors (3653696425662).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3105270246978 is a wasteful number, since it uses less digits than its factorization.
3105270246978 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 81543 (or 81540 counting only the distinct ones).
The product of its (nonzero) digits is 5080320, while the sum is 54.
The spelling of 3105270246978 in words is "three trillion, one hundred five billion, two hundred seventy million, two hundred forty-six thousand, nine hundred seventy-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •