Base | Representation |
---|---|
bin | 10011001110111000… |
… | …11001011100110011 |
3 | 222122121010022001200 |
4 | 21213130121130303 |
5 | 132121302311430 |
6 | 4424325502243 |
7 | 513605503425 |
oct | 114734313463 |
9 | 28577108050 |
10 | 10325432115 |
11 | 4419489a79 |
12 | 2001b71983 |
13 | c8725105b |
14 | 6dd476815 |
15 | 406742460 |
hex | 267719733 |
10325432115 has 48 divisors (see below), whose sum is σ = 18446313600. Its totient is φ = 5340162816.
The previous prime is 10325432081. The next prime is 10325432123. The reversal of 10325432115 is 51123452301.
10325432115 is a `hidden beast` number, since 1 + 0 + 3 + 2 + 543 + 2 + 115 = 666.
It is not a de Polignac number, because 10325432115 - 28 = 10325431859 is a prime.
It is a super-3 number, since 3×103254321153 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 208141 + ... + 252929.
It is an arithmetic number, because the mean of its divisors is an integer number (384298200).
Almost surely, 210325432115 is an apocalyptic number.
10325432115 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
10325432115 is a deficient number, since it is larger than the sum of its proper divisors (8120881485).
10325432115 is a wasteful number, since it uses less digits than its factorization.
10325432115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44956 (or 44953 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
Adding to 10325432115 its reverse (51123452301), we get a palindrome (61448884416).
The spelling of 10325432115 in words is "ten billion, three hundred twenty-five million, four hundred thirty-two thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •