Base | Representation |
---|---|
bin | 100011100101011000111110… |
… | …0001011010101100111011000 |
3 | 1112001020201011220121210101220 |
4 | 1013022301330023111213120 |
5 | 312011211320210311300 |
6 | 3025411104444012040 |
7 | 122633441215156305 |
oct | 10712617413254730 |
9 | 1461221156553356 |
10 | 313002120010200 |
11 | 908064a9885265 |
12 | 2b131aa8831020 |
13 | 10585c8636602a |
14 | 57415522360ac |
15 | 262bd841b1da0 |
hex | 11cac7c2d59d8 |
313002120010200 has 96 divisors (see below), whose sum is σ = 971792494491600. Its totient is φ = 83339410716160.
The previous prime is 313002120010141. The next prime is 313002120010241. The reversal of 313002120010200 is 2010021200313.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 313002120010200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 399049395 + ... + 399832994.
Almost surely, 2313002120010200 is an apocalyptic number.
313002120010200 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
313002120010200 is an abundant number, since it is smaller than the sum of its proper divisors (658790374481400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313002120010200 is a wasteful number, since it uses less digits than its factorization.
313002120010200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 798883061 (or 798883052 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 313002120010200 its reverse (2010021200313), we get a palindrome (315012141210513).
The spelling of 313002120010200 in words is "three hundred thirteen trillion, two billion, one hundred twenty million, ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •