Base | Representation |
---|---|
bin | 100011101110001101010010… |
… | …1111010011111000100001011 |
3 | 1112012112120020222112101021012 |
4 | 1013130122211322133010023 |
5 | 312141040233224404003 |
6 | 3032135530323434135 |
7 | 123120132601552430 |
oct | 10734324572370413 |
9 | 1465476228471235 |
10 | 314214001013003 |
11 | 91133456036633 |
12 | 2b2a894122594b |
13 | 1064333a24cbc0 |
14 | 5784078643b87 |
15 | 264d661e648d8 |
hex | 11dc6a5e9f10b |
314214001013003 has 8 divisors (see below), whose sum is σ = 386724924323808. Its totient is φ = 248608879922304.
The previous prime is 314214001012991. The next prime is 314214001013023. The reversal of 314214001013003 is 300310100412413.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 314214001013003 - 216 = 314214000947467 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 314214001013003.
It is not an unprimeable number, because it can be changed into a prime (314214001013023) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1726450554926 + ... + 1726450555107.
It is an arithmetic number, because the mean of its divisors is an integer number (48340615540476).
Almost surely, 2314214001013003 is an apocalyptic number.
314214001013003 is a deficient number, since it is larger than the sum of its proper divisors (72510923310805).
314214001013003 is a wasteful number, since it uses less digits than its factorization.
314214001013003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3452901110053.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 314214001013003 its reverse (300310100412413), we get a palindrome (614524101425416).
The spelling of 314214001013003 in words is "three hundred fourteen trillion, two hundred fourteen billion, one million, thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •