Base | Representation |
---|---|
bin | 1001000111111001101… |
… | …01000010001100001001 |
3 | 1002222010220210211002011 |
4 | 10203330311002030021 |
5 | 20114001212000340 |
6 | 400002131335521 |
7 | 31435211663200 |
oct | 4437465021411 |
9 | 1088126724064 |
10 | 313479406345 |
11 | 110a44a52846 |
12 | 509077515a1 |
13 | 2373a624cb1 |
14 | 1125b422237 |
15 | 824ac5c0ea |
hex | 48fcd42309 |
313479406345 has 12 divisors (see below), whose sum is σ = 437591661444. Its totient is φ = 214957307040.
The previous prime is 313479406291. The next prime is 313479406363. The reversal of 313479406345 is 543604974313.
It can be written as a sum of positive squares in 2 ways, for example, as 45307676736 + 268171729609 = 212856^2 + 517853^2 .
It is not a de Polignac number, because 313479406345 - 27 = 313479406217 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 639753646 + ... + 639754135.
It is an arithmetic number, because the mean of its divisors is an integer number (36465971787).
Almost surely, 2313479406345 is an apocalyptic number.
313479406345 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
313479406345 is a deficient number, since it is larger than the sum of its proper divisors (124112255099).
313479406345 is a wasteful number, since it uses less digits than its factorization.
313479406345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1279507800 (or 1279507793 counting only the distinct ones).
The product of its (nonzero) digits is 3265920, while the sum is 49.
The spelling of 313479406345 in words is "three hundred thirteen billion, four hundred seventy-nine million, four hundred six thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •