Base | Representation |
---|---|
bin | 1001001001010100110… |
… | …10001100101001011111 |
3 | 1010001010012202110102210 |
4 | 10210222122030221133 |
5 | 20122032443420411 |
6 | 400210050051503 |
7 | 31463155655403 |
oct | 4445232145137 |
9 | 1101105673383 |
10 | 314244123231 |
11 | 1112a7684975 |
12 | 50a9b879b93 |
13 | 2382cba32ac |
14 | 112d0c05103 |
15 | 8292e64ca6 |
hex | 492a68ca5f |
314244123231 has 32 divisors (see below), whose sum is σ = 435991412736. Its totient is φ = 201106620000.
The previous prime is 314244123229. The next prime is 314244123283. The reversal of 314244123231 is 132321442413.
It is not a de Polignac number, because 314244123231 - 21 = 314244123229 is a prime.
It is a super-2 number, since 2×3142441232312 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (314244123211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 43940506 + ... + 43947656.
It is an arithmetic number, because the mean of its divisors is an integer number (13624731648).
Almost surely, 2314244123231 is an apocalyptic number.
314244123231 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
314244123231 is a deficient number, since it is larger than the sum of its proper divisors (121747289505).
314244123231 is a wasteful number, since it uses less digits than its factorization.
314244123231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10923.
The product of its digits is 13824, while the sum is 30.
Adding to 314244123231 its reverse (132321442413), we get a palindrome (446565565644).
The spelling of 314244123231 in words is "three hundred fourteen billion, two hundred forty-four million, one hundred twenty-three thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •