Base | Representation |
---|---|
bin | 101000000001111101011100… |
… | …1100001000011101000001101 |
3 | 1201011201200111211122201102022 |
4 | 1100003322321201003220031 |
5 | 332123010133023424440 |
6 | 3244514311304535525 |
7 | 134111222252044430 |
oct | 12003727141035015 |
9 | 1634650454581368 |
10 | 352113121311245 |
11 | a2215377456878 |
12 | 335a9a6ba815a5 |
13 | 12162181436288 |
14 | 62d451a457817 |
15 | 2aa940c5ebcb5 |
hex | 1403eb9843a0d |
352113121311245 has 16 divisors (see below), whose sum is σ = 482898717664128. Its totient is φ = 241448636109120.
The previous prime is 352113121311197. The next prime is 352113121311251. The reversal of 352113121311245 is 542113121311253.
It is not a de Polignac number, because 352113121311245 - 222 = 352113117116941 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 17349362 + ... + 31705308.
It is an arithmetic number, because the mean of its divisors is an integer number (30181169854008).
Almost surely, 2352113121311245 is an apocalyptic number.
352113121311245 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
352113121311245 is a deficient number, since it is larger than the sum of its proper divisors (130785596352883).
352113121311245 is a wasteful number, since it uses less digits than its factorization.
352113121311245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15056740.
The product of its digits is 21600, while the sum is 35.
Adding to 352113121311245 its reverse (542113121311253), we get a palindrome (894226242622498).
The spelling of 352113121311245 in words is "three hundred fifty-two trillion, one hundred thirteen billion, one hundred twenty-one million, three hundred eleven thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •