Base | Representation |
---|---|
bin | 1001000111011010101… |
… | …11100001000100111100 |
3 | 1002221110211201010121020 |
4 | 10203231113201010330 |
5 | 20112433310312200 |
6 | 355520303504140 |
7 | 31425612105411 |
oct | 4435527410474 |
9 | 1087424633536 |
10 | 313220010300 |
11 | 11092159174a |
12 | 508548b8050 |
13 | 236c8972902 |
14 | 11234bbc108 |
15 | 82330bdea0 |
hex | 48ed5e113c |
313220010300 has 144 divisors (see below), whose sum is σ = 984720307200. Its totient is φ = 76576665600.
The previous prime is 313220010293. The next prime is 313220010353. The reversal of 313220010300 is 3010022313.
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 313220010300.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 709605 + ... + 1063004.
Almost surely, 2313220010300 is an apocalyptic number.
313220010300 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
313220010300 is an abundant number, since it is smaller than the sum of its proper divisors (671500296900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313220010300 is a wasteful number, since it uses less digits than its factorization.
313220010300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1772676 (or 1772669 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 313220010300 its reverse (3010022313), we get a palindrome (316230032613).
The spelling of 313220010300 in words is "three hundred thirteen billion, two hundred twenty million, ten thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •