Base | Representation |
---|---|
bin | 1001000111100101110… |
… | …10101101001011111110 |
3 | 1002221201022220122111111 |
4 | 10203302322231023332 |
5 | 20113131124333042 |
6 | 355533431312234 |
7 | 31431122405266 |
oct | 4436272551376 |
9 | 1087638818444 |
10 | 313313121022 |
11 | 11096a0a8160 |
12 | 5087bb1b67a |
13 | 23712043705 |
14 | 112432d87a6 |
15 | 823b362517 |
hex | 48f2ead2fe |
313313121022 has 32 divisors (see below), whose sum is σ = 513868561920. Its totient is φ = 142089213120.
The previous prime is 313313120987. The next prime is 313313121029. The reversal of 313313121022 is 220121313313.
It is a super-2 number, since 2×3133131210222 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 313313120984 and 313313121002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (313313121029) 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, 18862573 + ... + 18879175.
It is an arithmetic number, because the mean of its divisors is an integer number (16058392560).
Almost surely, 2313313121022 is an apocalyptic number.
313313121022 is a deficient number, since it is larger than the sum of its proper divisors (200555440898).
313313121022 is a wasteful number, since it uses less digits than its factorization.
313313121022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18528.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 313313121022 its reverse (220121313313), we get a palindrome (533434434335).
The spelling of 313313121022 in words is "three hundred thirteen billion, three hundred thirteen million, one hundred twenty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •