Base | Representation |
---|---|
bin | 11101100001001000110… |
… | …11000000101100000101 |
3 | 10120221212222011002011010 |
4 | 32300210123000230011 |
5 | 113104112133423331 |
6 | 2053532222032433 |
7 | 133163254111266 |
oct | 16604433005405 |
9 | 3527788132133 |
10 | 1014223342341 |
11 | 3611476aa580 |
12 | 144691418719 |
13 | 74843c45541 |
14 | 3713545a96d |
15 | 1b5b02b4e46 |
hex | ec246c0b05 |
1014223342341 has 16 divisors (see below), whose sum is σ = 1522822146048. Its totient is φ = 594852399600.
The previous prime is 1014223342333. The next prime is 1014223342361. The reversal of 1014223342341 is 1432433224101.
It is not a de Polignac number, because 1014223342341 - 23 = 1014223342333 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1014223342299 and 1014223342308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1014223342361) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 495709311 + ... + 495711356.
It is an arithmetic number, because the mean of its divisors is an integer number (95176384128).
Almost surely, 21014223342341 is an apocalyptic number.
1014223342341 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1014223342341 is a deficient number, since it is larger than the sum of its proper divisors (508598803707).
1014223342341 is a wasteful number, since it uses less digits than its factorization.
1014223342341 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 991420712.
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 1014223342341 its reverse (1432433224101), we get a palindrome (2446656566442).
The spelling of 1014223342341 in words is "one trillion, fourteen billion, two hundred twenty-three million, three hundred forty-two thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •