Base | Representation |
---|---|
bin | 10111011110001111011011… |
… | …011010111011101101111101 |
3 | 111112111222222121121000201121 |
4 | 113132033123122323231331 |
5 | 102012333113334330023 |
6 | 1003320404153110541 |
7 | 30513232301510026 |
oct | 2736173332735575 |
9 | 445458877530647 |
10 | 103233220230013 |
11 | 2a990a655985a5 |
12 | b6b33586b8451 |
13 | 457ab0a55c943 |
14 | 1b6c72bba7c4d |
15 | be04edb58d5d |
hex | 5de3db6bbb7d |
103233220230013 has 16 divisors (see below), whose sum is σ = 111482300825280. Its totient is φ = 95297997481344.
The previous prime is 103233220229999. The next prime is 103233220230037. The reversal of 103233220230013 is 310032022332301.
It is a cyclic number.
It is not a de Polignac number, because 103233220230013 - 245 = 68048848141181 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103233220230013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103233220270013) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 448253206 + ... + 448483447.
It is an arithmetic number, because the mean of its divisors is an integer number (6967643801580).
Almost surely, 2103233220230013 is an apocalyptic number.
It is an amenable number.
103233220230013 is a deficient number, since it is larger than the sum of its proper divisors (8249080595267).
103233220230013 is an equidigital number, since it uses as much as digits as its factorization.
103233220230013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 896736828.
The product of its (nonzero) digits is 3888, while the sum is 25.
Adding to 103233220230013 its reverse (310032022332301), we get a palindrome (413265242562314).
The spelling of 103233220230013 in words is "one hundred three trillion, two hundred thirty-three billion, two hundred twenty million, two hundred thirty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •