Base | Representation |
---|---|
bin | 100011100111101010010110… |
… | …0001001101001110110000100 |
3 | 1112002100112222222011200010120 |
4 | 1013033110230021221312010 |
5 | 312031320201330112400 |
6 | 3030210335035021540 |
7 | 122665132452266526 |
oct | 10717245411516604 |
9 | 1462315888150116 |
10 | 313314310004100 |
11 | 90916941a01389 |
12 | 2b1824b459a8b0 |
13 | 105a95497bc182 |
14 | 57526ca2d1a16 |
15 | 2635056b20ca0 |
hex | 11cf52c269d84 |
313314310004100 has 72 divisors (see below), whose sum is σ = 906772402101888. Its totient is φ = 83527472054400.
The previous prime is 313314310004089. The next prime is 313314310004131. The reversal of 313314310004100 is 1400013413313.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 142725219 + ... + 144903818.
It is an arithmetic number, because the mean of its divisors is an integer number (12594061140304).
Almost surely, 2313314310004100 is an apocalyptic number.
313314310004100 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is an amenable number.
313314310004100 is an abundant number, since it is smaller than the sum of its proper divisors (593458092097788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
313314310004100 is a wasteful number, since it uses less digits than its factorization.
313314310004100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 287632685 (or 287632678 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 313314310004100 its reverse (1400013413313), we get a palindrome (314714323417413).
The spelling of 313314310004100 in words is "three hundred thirteen trillion, three hundred fourteen billion, three hundred ten million, four thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •