Base | Representation |
---|---|
bin | 101111101001000111… |
… | …1001011101101101110 |
3 | 100210002021000211101012 |
4 | 1133102033023231232 |
5 | 3134013212141220 |
6 | 115000133145222 |
7 | 10251241630166 |
oct | 1372217135556 |
9 | 323067024335 |
10 | 102311443310 |
11 | 3a43216272a |
12 | 179b3a8b212 |
13 | 985666038b |
14 | 4d4802b5a6 |
15 | 29dc11bac5 |
hex | 17d23cbb6e |
102311443310 has 8 divisors (see below), whose sum is σ = 184160597976. Its totient is φ = 40924577320.
The previous prime is 102311443231. The next prime is 102311443379. The reversal of 102311443310 is 13344113201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1023114433102 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 5115572156 + ... + 5115572175.
It is an arithmetic number, because the mean of its divisors is an integer number (23020074747).
Almost surely, 2102311443310 is an apocalyptic number.
102311443310 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102311443310 is a deficient number, since it is larger than the sum of its proper divisors (81849154666).
102311443310 is a wasteful number, since it uses less digits than its factorization.
102311443310 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10231144338.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 102311443310 its reverse (13344113201), we get a palindrome (115655556511).
It can be divided in two parts, 10231 and 1443310, that added together give a palindrome (1453541).
The spelling of 102311443310 in words is "one hundred two billion, three hundred eleven million, four hundred forty-three thousand, three hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •