Base | Representation |
---|---|
bin | 10111011101110000110001… |
… | …010110010100100101000011 |
3 | 111112101212000111100221112020 |
4 | 113131300301112110211003 |
5 | 102011313204320421311 |
6 | 1003253321515532523 |
7 | 30510655456305360 |
oct | 2735606126244503 |
9 | 445355014327466 |
10 | 103200302123331 |
11 | 2a979003138856 |
12 | b6a8ab045a143 |
13 | 45779927573ca |
14 | 1b6acc7d93467 |
15 | bde723c65c06 |
hex | 5ddc31594943 |
103200302123331 has 32 divisors (see below), whose sum is σ = 158141733580800. Its totient is φ = 58640075655840.
The previous prime is 103200302123323. The next prime is 103200302123341. The reversal of 103200302123331 is 133321203002301.
It is not a de Polignac number, because 103200302123331 - 23 = 103200302123323 is a prime.
It is a super-2 number, since 2×1032003021233312 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103200302123341) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 109032210 + ... + 109974648.
It is an arithmetic number, because the mean of its divisors is an integer number (4941929174400).
Almost surely, 2103200302123331 is an apocalyptic number.
103200302123331 is a deficient number, since it is larger than the sum of its proper divisors (54941431457469).
103200302123331 is a wasteful number, since it uses less digits than its factorization.
103200302123331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 971759.
The product of its (nonzero) digits is 1944, while the sum is 24.
Adding to 103200302123331 its reverse (133321203002301), we get a palindrome (236521505125632).
The spelling of 103200302123331 in words is "one hundred three trillion, two hundred billion, three hundred two million, one hundred twenty-three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •