Base | Representation |
---|---|
bin | 1001001001011111000… |
… | …11011001010001110111 |
3 | 1010001100020010210211010 |
4 | 10210233203121101313 |
5 | 20122222041422333 |
6 | 400222411443303 |
7 | 31465254326442 |
oct | 4445743312167 |
9 | 1101306123733 |
10 | 314330420343 |
11 | 1113413671a5 |
12 | 50b04756533 |
13 | 23844a29984 |
14 | 112dc46a659 |
15 | 829a80e563 |
hex | 492f8d9477 |
314330420343 has 4 divisors (see below), whose sum is σ = 419107227128. Its totient is φ = 209553613560.
The previous prime is 314330420333. The next prime is 314330420347. The reversal of 314330420343 is 343024033413.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 314330420343 - 212 = 314330416247 is a prime.
It is a super-2 number, since 2×3143304203432 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 314330420343.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314330420347) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 52388403388 + ... + 52388403393.
It is an arithmetic number, because the mean of its divisors is an integer number (104776806782).
Almost surely, 2314330420343 is an apocalyptic number.
314330420343 is a deficient number, since it is larger than the sum of its proper divisors (104776806785).
314330420343 is a wasteful number, since it uses less digits than its factorization.
314330420343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104776806784.
The product of its (nonzero) digits is 31104, while the sum is 30.
Adding to 314330420343 its reverse (343024033413), we get a palindrome (657354453756).
The spelling of 314330420343 in words is "three hundred fourteen billion, three hundred thirty million, four hundred twenty thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •