Base | Representation |
---|---|
bin | 10111001100101111000111… |
… | …111110010111001011000111 |
3 | 111101021000001020211220020110 |
4 | 113030233013332113023013 |
5 | 101333131030100132221 |
6 | 1001000024005004103 |
7 | 30330306012044103 |
oct | 2714570776271307 |
9 | 441230036756213 |
10 | 102030303130311 |
11 | 2a567899213306 |
12 | b53a1a60b3633 |
13 | 44c15547c7c4a |
14 | 1b2a416096903 |
15 | bbe097d02776 |
hex | 5ccbc7f972c7 |
102030303130311 has 8 divisors (see below), whose sum is σ = 136040515432560. Its totient is φ = 68020146457472.
The previous prime is 102030303130307. The next prime is 102030303130367. The reversal of 102030303130311 is 113031303030201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102030303130311 - 22 = 102030303130307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102030303130211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9421020 + ... + 17111873.
It is an arithmetic number, because the mean of its divisors is an integer number (17005064429070).
Almost surely, 2102030303130311 is an apocalyptic number.
102030303130311 is a deficient number, since it is larger than the sum of its proper divisors (34010212302249).
102030303130311 is a wasteful number, since it uses less digits than its factorization.
102030303130311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27814705.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 102030303130311 its reverse (113031303030201), we get a palindrome (215061606160512).
The spelling of 102030303130311 in words is "one hundred two trillion, thirty billion, three hundred three million, one hundred thirty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •