Base | Representation |
---|---|
bin | 10111011100010011100100… |
… | …101010000011010101010101 |
3 | 111112001021201101021102200111 |
4 | 113130103210222003111111 |
5 | 102003143233141432013 |
6 | 1003135331540443021 |
7 | 30500513561435464 |
oct | 2734234452032525 |
9 | 445037641242614 |
10 | 103100231202133 |
11 | 2a93a6207725a0 |
12 | b6916229a9471 |
13 | 456b405345a79 |
14 | 1b661137509db |
15 | bdbd186bc73d |
hex | 5dc4e4a83555 |
103100231202133 has 32 divisors (see below), whose sum is σ = 119191882320000. Its totient is φ = 88195050213120.
The previous prime is 103100231202131. The next prime is 103100231202167. The reversal of 103100231202133 is 331202132001301.
It is a cyclic number.
It is not a de Polignac number, because 103100231202133 - 21 = 103100231202131 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103100231202131) 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, 1077088191 + ... + 1077183907.
It is an arithmetic number, because the mean of its divisors is an integer number (3724746322500).
Almost surely, 2103100231202133 is an apocalyptic number.
It is an amenable number.
103100231202133 is a deficient number, since it is larger than the sum of its proper divisors (16091651117867).
103100231202133 is a wasteful number, since it uses less digits than its factorization.
103100231202133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130485.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 103100231202133 its reverse (331202132001301), we get a palindrome (434302363203434).
The spelling of 103100231202133 in words is "one hundred three trillion, one hundred billion, two hundred thirty-one million, two hundred two thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •