Base | Representation |
---|---|
bin | 10111011110001100101111… |
… | …010010011110000000011011 |
3 | 111112111201112100111111200021 |
4 | 113132030233102132000123 |
5 | 102012311210034030021 |
6 | 1003315205431251311 |
7 | 30513100603663345 |
oct | 2736145722360033 |
9 | 445451470444607 |
10 | 103230332330011 |
11 | 2a98a813433587 |
12 | b6b2891519b37 |
13 | 457a76a167583 |
14 | 1b6c536422295 |
15 | be03d0359c41 |
hex | 5de32f49e01b |
103230332330011 has 4 divisors (see below), whose sum is σ = 104644446471592. Its totient is φ = 101816218188432.
The previous prime is 103230332329997. The next prime is 103230332330063. The reversal of 103230332330011 is 110033233032301.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 103230332330011 - 25 = 103230332329979 is a prime.
It is a super-2 number, since 2×1032303323300112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (103230332330071) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 707057070681 + ... + 707057070826.
It is an arithmetic number, because the mean of its divisors is an integer number (26161111617898).
Almost surely, 2103230332330011 is an apocalyptic number.
103230332330011 is a deficient number, since it is larger than the sum of its proper divisors (1414114141581).
103230332330011 is an equidigital number, since it uses as much as digits as its factorization.
103230332330011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1414114141580.
The product of its (nonzero) digits is 2916, while the sum is 25.
Adding to 103230332330011 its reverse (110033233032301), we get a palindrome (213263565362312).
The spelling of 103230332330011 in words is "one hundred three trillion, two hundred thirty billion, three hundred thirty-two million, three hundred thirty thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •