Base | Representation |
---|---|
bin | 1011100010001010100… |
… | …00010011010110010101 |
3 | 1101212220202021122020102 |
4 | 11301011100103112111 |
5 | 22443110004031233 |
6 | 502020204343445 |
7 | 40426441002464 |
oct | 5610520232625 |
9 | 1355822248212 |
10 | 396298892693 |
11 | 143084436730 |
12 | 6497b844b85 |
13 | 2b4a891a712 |
14 | 152768149db |
15 | a496a141e8 |
hex | 5c45413595 |
396298892693 has 8 divisors (see below), whose sum is σ = 432384176736. Its totient is φ = 360223294000.
The previous prime is 396298892681. The next prime is 396298892701.
396298892693 is nontrivially palindromic in base 10.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 396298892693 - 24 = 396298892677 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 396298892693.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (396298892623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2335646 + ... + 2499567.
It is an arithmetic number, because the mean of its divisors is an integer number (54048022092).
Almost surely, 2396298892693 is an apocalyptic number.
It is an amenable number.
396298892693 is a deficient number, since it is larger than the sum of its proper divisors (36085284043).
396298892693 is a wasteful number, since it uses less digits than its factorization.
396298892693 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4842675.
The product of its digits is 544195584, while the sum is 74.
The spelling of 396298892693 in words is "three hundred ninety-six billion, two hundred ninety-eight million, eight hundred ninety-two thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •