Base | Representation |
---|---|
bin | 1101101011101101… |
… | …10001010010010001 |
3 | 200221221210111222122 |
4 | 12311312301102101 |
5 | 110021034013131 |
6 | 3212534144025 |
7 | 350016656441 |
oct | 66566612221 |
9 | 20857714878 |
10 | 7346001041 |
11 | 312a698345 |
12 | 15101b2015 |
13 | 900bbbba2 |
14 | 4d98a6121 |
15 | 2cedb2d7b |
hex | 1b5db1491 |
7346001041 has 2 divisors, whose sum is σ = 7346001042. Its totient is φ = 7346001040.
The previous prime is 7346001031. The next prime is 7346001079. The reversal of 7346001041 is 1401006437.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6900791041 + 445210000 = 83071^2 + 21100^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-7346001041 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 7346001041.
It is not a weakly prime, because it can be changed into another prime (7346001031) 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 as a sum of consecutive naturals, namely, 3673000520 + 3673000521.
It is an arithmetic number, because the mean of its divisors is an integer number (3673000521).
Almost surely, 27346001041 is an apocalyptic number.
It is an amenable number.
7346001041 is a deficient number, since it is larger than the sum of its proper divisors (1).
7346001041 is an equidigital number, since it uses as much as digits as its factorization.
7346001041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2016, while the sum is 26.
The square root of 7346001041 is about 85708.8154217523. The cubic root of 7346001041 is about 1943.9436060211.
Adding to 7346001041 its reverse (1401006437), we get a palindrome (8747007478).
The spelling of 7346001041 in words is "seven billion, three hundred forty-six million, one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •