Base | Representation |
---|---|
bin | 100011100111101000011111… |
… | …1100001011001111100011001 |
3 | 1112002100011202021222002210102 |
4 | 1013033100333201121330121 |
5 | 312031234034021431413 |
6 | 3030204441100425145 |
7 | 122664632205130640 |
oct | 10717207741317431 |
9 | 1462304667862712 |
10 | 313310340030233 |
11 | 90915194a66247 |
12 | 2b181786b481b5 |
13 | 105a9066181600 |
14 | 5752430d56357 |
15 | 2634dc332c458 |
hex | 11cf43f859f19 |
313310340030233 has 12 divisors (see below), whose sum is σ = 387731477435328. Its totient is φ = 247893895407600.
The previous prime is 313310340030169. The next prime is 313310340030253. The reversal of 313310340030233 is 332030043013313.
It is not a de Polignac number, because 313310340030233 - 26 = 313310340030169 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 313310340030196 and 313310340030205.
It is not an unprimeable number, because it can be changed into a prime (313310340030253) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 132421951493 + ... + 132421953858.
It is an arithmetic number, because the mean of its divisors is an integer number (32310956452944).
Almost surely, 2313310340030233 is an apocalyptic number.
It is an amenable number.
313310340030233 is a deficient number, since it is larger than the sum of its proper divisors (74421137405095).
313310340030233 is a wasteful number, since it uses less digits than its factorization.
313310340030233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264843905384 (or 264843905371 counting only the distinct ones).
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 313310340030233 its reverse (332030043013313), we get a palindrome (645340383043546).
The spelling of 313310340030233 in words is "three hundred thirteen trillion, three hundred ten billion, three hundred forty million, thirty thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •