Base | Representation |
---|---|
bin | 101111101011000000… |
… | …0010001011000101010 |
3 | 100210020122221201101102 |
4 | 1133112000101120222 |
5 | 3134130402040432 |
6 | 115010311521402 |
7 | 10252640052434 |
oct | 1372600213052 |
9 | 323218851342 |
10 | 102374643242 |
11 | 3a4648a9783 |
12 | 17a11089262 |
13 | 986678a9a1 |
14 | 4d5259d654 |
15 | 29e2952962 |
hex | 17d601162a |
102374643242 has 8 divisors (see below), whose sum is σ = 161644173600. Its totient is φ = 48493252044.
The previous prime is 102374643233. The next prime is 102374643247. The reversal of 102374643242 is 242346473201.
102374643242 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (38), and also a Moran number because the ratio is a prime number: 2694069559 = 102374643242 / (1 + 0 + 2 + 3 + 7 + 4 + 6 + 4 + 3 + 2 + 4 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 102374643196 and 102374643205.
It is not an unprimeable number, because it can be changed into a prime (102374643247) 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, 1347034742 + ... + 1347034817.
It is an arithmetic number, because the mean of its divisors is an integer number (20205521700).
Almost surely, 2102374643242 is an apocalyptic number.
102374643242 is a deficient number, since it is larger than the sum of its proper divisors (59269530358).
102374643242 is a wasteful number, since it uses less digits than its factorization.
102374643242 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2694069580.
The product of its (nonzero) digits is 193536, while the sum is 38.
The spelling of 102374643242 in words is "one hundred two billion, three hundred seventy-four million, six hundred forty-three thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •