Base | Representation |
---|---|
bin | 101111100010110101… |
… | …0000000110011111010 |
3 | 100202112112212022222022 |
4 | 1133011222000303322 |
5 | 3133100143411410 |
6 | 114523153154442 |
7 | 10243066564106 |
oct | 1370552006372 |
9 | 322475768868 |
10 | 102100372730 |
11 | 3a333aa9234 |
12 | 1795525ba22 |
13 | 98219cb145 |
14 | 4d27da6906 |
15 | 29c8827455 |
hex | 17c5a80cfa |
102100372730 has 8 divisors (see below), whose sum is σ = 183780670932. Its totient is φ = 40840149088.
The previous prime is 102100372687. The next prime is 102100372747. The reversal of 102100372730 is 37273001201.
It can be written as a sum of positive squares in 2 ways, for example, as 98123683009 + 3976689721 = 313247^2 + 63061^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1021003727302 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 102100372730.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5105018627 + ... + 5105018646.
Almost surely, 2102100372730 is an apocalyptic number.
102100372730 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102100372730 is a deficient number, since it is larger than the sum of its proper divisors (81680298202).
102100372730 is a wasteful number, since it uses less digits than its factorization.
102100372730 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10210037280.
The product of its (nonzero) digits is 1764, while the sum is 26.
Adding to 102100372730 its reverse (37273001201), we get a palindrome (139373373931).
The spelling of 102100372730 in words is "one hundred two billion, one hundred million, three hundred seventy-two thousand, seven hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •