Base | Representation |
---|---|
bin | 1010000001010011110… |
… | …10101011000011010001 |
3 | 1012220200220101012211112 |
4 | 11000221322223003101 |
5 | 21120111430131400 |
6 | 422100341223105 |
7 | 33606043032566 |
oct | 5005172530321 |
9 | 1186626335745 |
10 | 344300630225 |
11 | 1230208034a2 |
12 | 56889701a95 |
13 | 2660cb91486 |
14 | 1294295c86d |
15 | 8e51a01835 |
hex | 5029eab0d1 |
344300630225 has 12 divisors (see below), whose sum is σ = 441654602460. Its totient is φ = 265942555200.
The previous prime is 344300630207. The next prime is 344300630249. The reversal of 344300630225 is 522036003443.
It can be written as a sum of positive squares in 6 ways, for example, as 20421267409 + 323879362816 = 142903^2 + 569104^2 .
It is not a de Polignac number, because 344300630225 - 228 = 344032194769 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 344300630191 and 344300630200.
It is an unprimeable number.
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 11 ways as a sum of consecutive naturals, for example, 237447986 + ... + 237449435.
It is an arithmetic number, because the mean of its divisors is an integer number (36804550205).
Almost surely, 2344300630225 is an apocalyptic number.
It is an amenable number.
344300630225 is a deficient number, since it is larger than the sum of its proper divisors (97353972235).
344300630225 is a wasteful number, since it uses less digits than its factorization.
344300630225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 474897460 (or 474897455 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 32.
Adding to 344300630225 its reverse (522036003443), we get a palindrome (866336633668).
The spelling of 344300630225 in words is "three hundred forty-four billion, three hundred million, six hundred thirty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •