Base | Representation |
---|---|
bin | 1001010011110000111010… |
… | …0010101010000000000101 |
3 | 1100020110201021101101122220 |
4 | 2110330032202222000011 |
5 | 2320143042131013300 |
6 | 33433544035442553 |
7 | 2104315404214152 |
oct | 224741642520005 |
9 | 40213637341586 |
10 | 10235151032325 |
11 | 3296780a2305a |
12 | 1193783456459 |
13 | 59322aa6c0bb |
14 | 2755537d3229 |
15 | 12b38e32cda0 |
hex | 94f0e8aa005 |
10235151032325 has 12 divisors (see below), whose sum is σ = 16922116373568. Its totient is φ = 5458747217200.
The previous prime is 10235151032291. The next prime is 10235151032399. The reversal of 10235151032325 is 52323015153201.
It is not a de Polignac number, because 10235151032325 - 212 = 10235151028229 is a prime.
It is a congruent number.
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, 68234340141 + ... + 68234340290.
It is an arithmetic number, because the mean of its divisors is an integer number (1410176364464).
Almost surely, 210235151032325 is an apocalyptic number.
10235151032325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
10235151032325 is a deficient number, since it is larger than the sum of its proper divisors (6686965341243).
10235151032325 is a wasteful number, since it uses less digits than its factorization.
10235151032325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136468680444 (or 136468680439 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 33.
Adding to 10235151032325 its reverse (52323015153201), we get a palindrome (62558166185526).
The spelling of 10235151032325 in words is "ten trillion, two hundred thirty-five billion, one hundred fifty-one million, thirty-two thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •