Base | Representation |
---|---|
bin | 1001001000100001001… |
… | …01000001111000010010 |
3 | 1010000000000022002002220 |
4 | 10210100211001320102 |
5 | 20120141023130330 |
6 | 400055045321510 |
7 | 31446344256420 |
oct | 4442045017022 |
9 | 1100000262086 |
10 | 313810755090 |
11 | 1110a4a98a88 |
12 | 5099a706296 |
13 | 2379117a941 |
14 | 1128d436110 |
15 | 8269dae710 |
hex | 4910941e12 |
313810755090 has 256 divisors, whose sum is σ = 882895749120. Its totient is φ = 69910767360.
The previous prime is 313810755059. The next prime is 313810755101. The reversal of 313810755090 is 90557018313.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 819349039 + ... + 819349421.
It is an arithmetic number, because the mean of its divisors is an integer number (3448811520).
Almost surely, 2313810755090 is an apocalyptic number.
313810755090 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 313810755090, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (441447874560).
313810755090 is an abundant number, since it is smaller than the sum of its proper divisors (569084994030).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313810755090 is a wasteful number, since it uses less digits than its factorization.
313810755090 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 957.
The product of its (nonzero) digits is 113400, while the sum is 42.
The spelling of 313810755090 in words is "three hundred thirteen billion, eight hundred ten million, seven hundred fifty-five thousand, ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •