Base | Representation |
---|---|
bin | 1011001100010000101… |
… | …1000101011110110101 |
3 | 200101021121112220112110 |
4 | 2303010023011132311 |
5 | 11122232032121042 |
6 | 224154425041233 |
7 | 16614424226562 |
oct | 2630413053665 |
9 | 611247486473 |
10 | 192269801397 |
11 | 745a5321613 |
12 | 3131a926219 |
13 | 1519196266b |
14 | 943d5a9869 |
15 | 50049c009c |
hex | 2cc42c57b5 |
192269801397 has 8 divisors (see below), whose sum is σ = 259002619456. Its totient is φ = 126858425472.
The previous prime is 192269801369. The next prime is 192269801413. The reversal of 192269801397 is 793108962291.
192269801397 is digitally balanced in base 2, 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 not a de Polignac number, because 192269801397 - 26 = 192269801333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (192269401397) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 330360193 + ... + 330360774.
It is an arithmetic number, because the mean of its divisors is an integer number (32375327432).
Almost surely, 2192269801397 is an apocalyptic number.
It is an amenable number.
192269801397 is a deficient number, since it is larger than the sum of its proper divisors (66732818059).
192269801397 is an equidigital number, since it uses as much as digits as its factorization.
192269801397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 660721067.
The product of its (nonzero) digits is 2939328, while the sum is 57.
The spelling of 192269801397 in words is "one hundred ninety-two billion, two hundred sixty-nine million, eight hundred one thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •