Base | Representation |
---|---|
bin | 100011101101100111000111… |
… | …1000110111110010010001101 |
3 | 1112012020201122011120012202201 |
4 | 1013123032033012332102031 |
5 | 312133214331043011023 |
6 | 3032034131030121501 |
7 | 123111201101661352 |
oct | 10733161706762215 |
9 | 1465221564505681 |
10 | 314132014032013 |
11 | 91101703575301 |
12 | 2b294a7bab0291 |
13 | 106386a257b7b8 |
14 | 57800dba3c629 |
15 | 264b464305bad |
hex | 11db38f1be48d |
314132014032013 has 32 divisors (see below), whose sum is σ = 347529080504160. Its totient is φ = 282597684633600.
The previous prime is 314132014032007. The next prime is 314132014032029. The reversal of 314132014032013 is 310230410231413.
It can be written as a sum of positive squares in 16 ways, for example, as 16635646857124 + 297496367174889 = 4078682^2 + 17248083^2 .
It is a cyclic number.
It is not a de Polignac number, because 314132014032013 - 25 = 314132014031981 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314132014042013) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 409562631 + ... + 410328907.
It is an arithmetic number, because the mean of its divisors is an integer number (10860283765755).
Almost surely, 2314132014032013 is an apocalyptic number.
It is an amenable number.
314132014032013 is a deficient number, since it is larger than the sum of its proper divisors (33397066472147).
314132014032013 is a wasteful number, since it uses less digits than its factorization.
314132014032013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 774657.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 314132014032013 its reverse (310230410231413), we get a palindrome (624362424263426).
The spelling of 314132014032013 in words is "three hundred fourteen trillion, one hundred thirty-two billion, fourteen million, thirty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •