Base | Representation |
---|---|
bin | 10111011011000100001101… |
… | …010001010111010010111000 |
3 | 111111202010202101122221022201 |
4 | 113123010031101113102320 |
5 | 102000244221343001412 |
6 | 1003032235504155544 |
7 | 30461406030003226 |
oct | 2733041521272270 |
9 | 444663671587281 |
10 | 103015013250232 |
11 | 2a907470424a76 |
12 | b678bbb608bb4 |
13 | 4563374180c65 |
14 | 1b61d4b9bbb16 |
15 | bd99cc093e57 |
hex | 5db10d4574b8 |
103015013250232 has 32 divisors (see below), whose sum is σ = 194699932416000. Its totient is φ = 51095139155424.
The previous prime is 103015013250223. The next prime is 103015013250269. The reversal of 103015013250232 is 232052310510301.
It is a super-2 number, since 2×1030150132502322 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 103015013250232.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 904519 + ... + 14382217.
It is an arithmetic number, because the mean of its divisors is an integer number (6084372888000).
Almost surely, 2103015013250232 is an apocalyptic number.
It is an amenable number.
103015013250232 is a deficient number, since it is larger than the sum of its proper divisors (91684919165768).
103015013250232 is a wasteful number, since it uses less digits than its factorization.
103015013250232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13485355 (or 13485351 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 28.
Adding to 103015013250232 its reverse (232052310510301), we get a palindrome (335067323760533).
The spelling of 103015013250232 in words is "one hundred three trillion, fifteen billion, thirteen million, two hundred fifty thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •