Base | Representation |
---|---|
bin | 1001010011011011111… |
… | …10010101010110010000 |
3 | 1010120010112110112010111 |
4 | 10221231332111112100 |
5 | 20214142143334231 |
6 | 402504450011104 |
7 | 32044533402541 |
oct | 4515576252620 |
9 | 1116115415114 |
10 | 319672636816 |
11 | 113632962535 |
12 | 51b55876a94 |
13 | 241b6747a00 |
14 | 11687b704c8 |
15 | 84ae8134b1 |
hex | 4a6df95590 |
319672636816 has 135 divisors (see below), whose sum is σ = 684073536897. Its totient is φ = 144650912640.
The previous prime is 319672636813. The next prime is 319672636847. The reversal of 319672636816 is 618636276913.
It is a happy number.
The square root of 319672636816 is 565396.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 47288851600 + 272383785216 = 217460^2 + 521904^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (319672636813) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 2440249071 + ... + 2440249201.
Almost surely, 2319672636816 is an apocalyptic number.
319672636816 is the 565396-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 319672636816
319672636816 is an abundant number, since it is smaller than the sum of its proper divisors (364400900081).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
319672636816 is an equidigital number, since it uses as much as digits as its factorization.
319672636816 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 462 (or 229 counting only the distinct ones).
The product of its digits is 11757312, while the sum is 58.
The spelling of 319672636816 in words is "three hundred nineteen billion, six hundred seventy-two million, six hundred thirty-six thousand, eight hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •