Base | Representation |
---|---|
bin | 10000101000000001… |
… | …10011101000011101 |
3 | 212001001021001101211 |
4 | 20110000303220131 |
5 | 121234434043042 |
6 | 4033404304421 |
7 | 434121054661 |
oct | 102400635035 |
9 | 25031231354 |
10 | 8925690397 |
11 | 3870357338 |
12 | 1891242111 |
13 | ac3263010 |
14 | 6095d08a1 |
15 | 3738ee017 |
hex | 214033a1d |
8925690397 has 4 divisors (see below), whose sum is σ = 9612281980. Its totient is φ = 8239098816.
The previous prime is 8925690349. The next prime is 8925690413. The reversal of 8925690397 is 7930965298.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3922391641 + 5003298756 = 62629^2 + 70734^2 .
It is a de Polignac number, because none of the positive numbers 2k-8925690397 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 (8925690997) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 343295772 + ... + 343295797.
It is an arithmetic number, because the mean of its divisors is an integer number (2403070495).
Almost surely, 28925690397 is an apocalyptic number.
It is an amenable number.
8925690397 is a deficient number, since it is larger than the sum of its proper divisors (686591583).
8925690397 is a wasteful number, since it uses less digits than its factorization.
8925690397 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 686591582.
The product of its (nonzero) digits is 7348320, while the sum is 58.
The square root of 8925690397 is about 94475.8720361977. The cubic root of 8925690397 is about 2074.3431721431.
The spelling of 8925690397 in words is "eight billion, nine hundred twenty-five million, six hundred ninety thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •