Base | Representation |
---|---|
bin | 100011101101110101110101… |
… | …0011110001110010011001100 |
3 | 1112012100202012021000020020120 |
4 | 1013123223222132032103030 |
5 | 312134224034033442102 |
6 | 3032100434252144540 |
7 | 123113400111042606 |
oct | 10733535236162314 |
9 | 1465322167006216 |
10 | 314163611624652 |
11 | 91114048596329 |
12 | 2b29b019a68150 |
13 | 1063b66991598a |
14 | 5781858312176 |
15 | 264c1b33056bc |
hex | 11dbaea78e4cc |
314163611624652 has 12 divisors (see below), whose sum is σ = 733048427124216. Its totient is φ = 104721203874880.
The previous prime is 314163611624591. The next prime is 314163611624671. The reversal of 314163611624652 is 256426116361413.
It is a tau number, because it is divible by the number of its divisors (12).
It is a super-2 number, since 2×3141636116246522 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 314163611624595 and 314163611624604.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13090150484349 + ... + 13090150484372.
It is an arithmetic number, because the mean of its divisors is an integer number (61087368927018).
Almost surely, 2314163611624652 is an apocalyptic number.
It is an amenable number.
314163611624652 is an abundant number, since it is smaller than the sum of its proper divisors (418884815499564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
314163611624652 is a wasteful number, since it uses less digits than its factorization.
314163611624652 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26180300968728 (or 26180300968726 counting only the distinct ones).
The product of its digits is 3732480, while the sum is 51.
The spelling of 314163611624652 in words is "three hundred fourteen trillion, one hundred sixty-three billion, six hundred eleven million, six hundred twenty-four thousand, six hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •