Base | Representation |
---|---|
bin | 10100010001110111001… |
… | …000111010110010010111 |
3 | 11221020001011111001110120 |
4 | 110101313020322302113 |
5 | 140313011431334201 |
6 | 2544110231323023 |
7 | 202452630341430 |
oct | 24216710726227 |
9 | 4836034431416 |
10 | 1393568230551 |
11 | 498010a32752 |
12 | 1a60bb220473 |
13 | a154a255333 |
14 | 4b640326487 |
15 | 263b368a536 |
hex | 1447723ac97 |
1393568230551 has 8 divisors (see below), whose sum is σ = 2123532541824. Its totient is φ = 796324703160.
The previous prime is 1393568230469. The next prime is 1393568230591. The reversal of 1393568230551 is 1550328653931.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1393568230551 - 213 = 1393568222359 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1393568230494 and 1393568230503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1393568230591) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33180195945 + ... + 33180195986.
It is an arithmetic number, because the mean of its divisors is an integer number (265441567728).
Almost surely, 21393568230551 is an apocalyptic number.
1393568230551 is a deficient number, since it is larger than the sum of its proper divisors (729964311273).
1393568230551 is an equidigital number, since it uses as much as digits as its factorization.
1393568230551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66360391941.
The product of its (nonzero) digits is 2916000, while the sum is 51.
The spelling of 1393568230551 in words is "one trillion, three hundred ninety-three billion, five hundred sixty-eight million, two hundred thirty thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •