Base | Representation |
---|---|
bin | 1001001001010011100… |
… | …11101000000111100011 |
3 | 1010001002111201202121121 |
4 | 10210221303220013203 |
5 | 20122022401342011 |
6 | 400205045233111 |
7 | 31463004014104 |
oct | 4445163500743 |
9 | 1101074652547 |
10 | 314234012131 |
11 | 1112a19a9296 |
12 | 50a98402797 |
13 | 2382aa72cb0 |
14 | 112cd7323ab |
15 | 8292118e71 |
hex | 4929ce81e3 |
314234012131 has 8 divisors (see below), whose sum is σ = 340009681424. Its totient is φ = 288687460320.
The previous prime is 314234012063. The next prime is 314234012137. The reversal of 314234012131 is 131210432413.
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 314234012131 - 213 = 314234003939 is a prime.
It is a super-2 number, since 2×3142340121312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 314234012096 and 314234012105.
It is not an unprimeable number, because it can be changed into a prime (314234012137) 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, 57276516 + ... + 57282001.
It is an arithmetic number, because the mean of its divisors is an integer number (42501210178).
Almost surely, 2314234012131 is an apocalyptic number.
314234012131 is a deficient number, since it is larger than the sum of its proper divisors (25775669293).
314234012131 is a wasteful number, since it uses less digits than its factorization.
314234012131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 114558741.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 314234012131 its reverse (131210432413), we get a palindrome (445444444544).
The spelling of 314234012131 in words is "three hundred fourteen billion, two hundred thirty-four million, twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •