Base | Representation |
---|---|
bin | 100011100111100011110101… |
… | …1001001001001110101010100 |
3 | 1112002022012220222201001211202 |
4 | 1013033013223021021311110 |
5 | 312031103041104431202 |
6 | 3030200104154252032 |
7 | 122664126232124033 |
oct | 10717075311116524 |
9 | 1462265828631752 |
10 | 313300334452052 |
11 | 90910a20091272 |
12 | 2b17b854127018 |
13 | 105a813029014c |
14 | 5751b6218071a |
15 | 26349d9c1b802 |
hex | 11cf1eb249d54 |
313300334452052 has 12 divisors (see below), whose sum is σ = 580527090308340. Its totient is φ = 147435451506816.
The previous prime is 313300334452037. The next prime is 313300334452093. The reversal of 313300334452052 is 250254433003313.
It can be written as a sum of positive squares in 2 ways, for example, as 170222278049476 + 143078056402576 = 13046926^2 + 11961524^2 .
It is a junction number, because it is equal to n+sod(n) for n = 313300334451997 and 313300334452015.
It is a congruent number.
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, 2303678929727 + ... + 2303678929862.
It is an arithmetic number, because the mean of its divisors is an integer number (48377257525695).
Almost surely, 2313300334452052 is an apocalyptic number.
It is an amenable number.
313300334452052 is a deficient number, since it is larger than the sum of its proper divisors (267226755856288).
313300334452052 is a wasteful number, since it uses less digits than its factorization.
313300334452052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4607357859610 (or 4607357859608 counting only the distinct ones).
The product of its (nonzero) digits is 388800, while the sum is 38.
Adding to 313300334452052 its reverse (250254433003313), we get a palindrome (563554767455365).
The spelling of 313300334452052 in words is "three hundred thirteen trillion, three hundred billion, three hundred thirty-four million, four hundred fifty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •