Base | Representation |
---|---|
bin | 100011110001011111000011… |
… | …0010011101111110011110000 |
3 | 1112021010121221000100011110212 |
4 | 1013202332012103233303300 |
5 | 312220430234214032402 |
6 | 3033122503232243252 |
7 | 123164520134563622 |
oct | 10742760623576360 |
9 | 1467117830304425 |
10 | 314664442330352 |
11 | 91297493457264 |
12 | 2b3600b10a0528 |
13 | 10676963ba788a |
14 | 579bba99b4c12 |
15 | 265a226d28952 |
hex | 11e2f864efcf0 |
314664442330352 has 20 divisors (see below), whose sum is σ = 645524848604736. Its totient is φ = 148077384625920.
The previous prime is 314664442330331. The next prime is 314664442330361. The reversal of 314664442330352 is 253033244466413.
It is a super-2 number, since 2×3146644423303522 (a number of 30 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 314664442330352.
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, 578427283424 + ... + 578427283967.
Almost surely, 2314664442330352 is an apocalyptic number.
It is an amenable number.
314664442330352 is an abundant number, since it is smaller than the sum of its proper divisors (330860406274384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
314664442330352 is a wasteful number, since it uses less digits than its factorization.
314664442330352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1156854567416 (or 1156854567410 counting only the distinct ones).
The product of its (nonzero) digits is 14929920, while the sum is 50.
Adding to 314664442330352 its reverse (253033244466413), we get a palindrome (567697686796765).
The spelling of 314664442330352 in words is "three hundred fourteen trillion, six hundred sixty-four billion, four hundred forty-two million, three hundred thirty thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •