Base | Representation |
---|---|
bin | 110100100110000100000011… |
… | …011111110110010011110010 |
3 | 1010100000102011012112111001122 |
4 | 310212010003133312103302 |
5 | 220304322300224404414 |
6 | 2135544123004502242 |
7 | 66502615224426416 |
oct | 6446040337662362 |
9 | 1110012135474048 |
10 | 231314112341234 |
11 | 6778184508541a |
12 | 21b3a28424a982 |
13 | 9c0ba9a479320 |
14 | 411993c916d46 |
15 | 1bb2026bb2b8e |
hex | d261037f64f2 |
231314112341234 has 8 divisors (see below), whose sum is σ = 373661258397420. Its totient is φ = 106760359542096.
The previous prime is 231314112341227. The next prime is 231314112341261. The reversal of 231314112341234 is 432143211413132.
231314112341234 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 184652849222209 + 46661263119025 = 13588703^2 + 6830905^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 231314112341194 and 231314112341203.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4448348314229 + ... + 4448348314280.
Almost surely, 2231314112341234 is an apocalyptic number.
231314112341234 is a deficient number, since it is larger than the sum of its proper divisors (142347146056186).
231314112341234 is a wasteful number, since it uses less digits than its factorization.
231314112341234 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8896696628524.
The product of its digits is 41472, while the sum is 35.
Adding to 231314112341234 its reverse (432143211413132), we get a palindrome (663457323754366).
The spelling of 231314112341234 in words is "two hundred thirty-one trillion, three hundred fourteen billion, one hundred twelve million, three hundred forty-one thousand, two hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •