Base | Representation |
---|---|
bin | 100010010000100011001… |
… | …000000101011001111101 |
3 | 22100001200102201102222211 |
4 | 202100203020011121331 |
5 | 302032431214300221 |
6 | 5001304033140421 |
7 | 332042022503452 |
oct | 42204310053175 |
9 | 8301612642884 |
10 | 2354231400061 |
11 | 828473283682 |
12 | 3203233ba711 |
13 | 1410069839c8 |
14 | 81d342ad829 |
15 | 4138b7646e1 |
hex | 2242320567d |
2354231400061 has 16 divisors (see below), whose sum is σ = 2367371698560. Its totient is φ = 2341122094080.
The previous prime is 2354231399977. The next prime is 2354231400071. The reversal of 2354231400061 is 1600041324532.
It is a cyclic number.
It is not a de Polignac number, because 2354231400061 - 229 = 2353694529149 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2354231399996 and 2354231400032.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2354231400071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 884051016 + ... + 884053678.
It is an arithmetic number, because the mean of its divisors is an integer number (147960731160).
Almost surely, 22354231400061 is an apocalyptic number.
It is an amenable number.
2354231400061 is a deficient number, since it is larger than the sum of its proper divisors (13140298499).
2354231400061 is a wasteful number, since it uses less digits than its factorization.
2354231400061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6756.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 2354231400061 its reverse (1600041324532), we get a palindrome (3954272724593).
The spelling of 2354231400061 in words is "two trillion, three hundred fifty-four billion, two hundred thirty-one million, four hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •