Base | Representation |
---|---|
bin | 10111011111001111100110… |
… | …110000110110010101010001 |
3 | 111112202120212001111002212111 |
4 | 113133033212300312111101 |
5 | 102020000230240014413 |
6 | 1003412202100425321 |
7 | 30521222040061102 |
oct | 2737174660662521 |
9 | 445676761432774 |
10 | 103302130001233 |
11 | 2aa08207339649 |
12 | b70478a3a8241 |
13 | 458446cb67cb7 |
14 | 1b71bc7aa63a9 |
15 | be21d36b3d3d |
hex | 5df3e6c36551 |
103302130001233 has 4 divisors (see below), whose sum is σ = 103303591887600. Its totient is φ = 103300668114868.
The previous prime is 103302130001219. The next prime is 103302130001311. The reversal of 103302130001233 is 332100031203301.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 103302130001233 - 29 = 103302130000721 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (103302130301233) 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, 730837183 + ... + 730978516.
It is an arithmetic number, because the mean of its divisors is an integer number (25825897971900).
Almost surely, 2103302130001233 is an apocalyptic number.
It is an amenable number.
103302130001233 is a deficient number, since it is larger than the sum of its proper divisors (1461886367).
103302130001233 is an equidigital number, since it uses as much as digits as its factorization.
103302130001233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1461886366.
The product of its (nonzero) digits is 972, while the sum is 22.
Adding to 103302130001233 its reverse (332100031203301), we get a palindrome (435402161204534).
The spelling of 103302130001233 in words is "one hundred three trillion, three hundred two billion, one hundred thirty million, one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •