Base | Representation |
---|---|
bin | 1100110110100101… |
… | …01001010001001001 |
3 | 122210220011202012101 |
4 | 12123102221101021 |
5 | 103112440322101 |
6 | 3100413513401 |
7 | 332665531636 |
oct | 63322512111 |
9 | 18726152171 |
10 | 6900323401 |
11 | 2a21064114 |
12 | 1406aa2861 |
13 | 85c7766ca |
14 | 49661118d |
15 | 2a5bca401 |
hex | 19b4a9449 |
6900323401 has 2 divisors, whose sum is σ = 6900323402. Its totient is φ = 6900323400.
The previous prime is 6900323323. The next prime is 6900323413. The reversal of 6900323401 is 1043230096.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6601725001 + 298598400 = 81251^2 + 17280^2 .
It is a cyclic number.
It is not a de Polignac number, because 6900323401 - 29 = 6900322889 is a prime.
It is a super-2 number, since 2×69003234012 = 95228926076776413602, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 6900323401.
It is not a weakly prime, because it can be changed into another prime (6900353401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 3450161700 + 3450161701.
It is an arithmetic number, because the mean of its divisors is an integer number (3450161701).
Almost surely, 26900323401 is an apocalyptic number.
It is an amenable number.
6900323401 is a deficient number, since it is larger than the sum of its proper divisors (1).
6900323401 is an equidigital number, since it uses as much as digits as its factorization.
6900323401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 6900323401 is about 83068.1852516353. The cubic root of 6900323401 is about 1903.8080046771.
Adding to 6900323401 its reverse (1043230096), we get a palindrome (7943553497).
The spelling of 6900323401 in words is "six billion, nine hundred million, three hundred twenty-three thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •