Base | Representation |
---|---|
bin | 101011100000111110… |
… | …011011000011010001 |
3 | 11110121021200220000011 |
4 | 223200332123003101 |
5 | 1231142334224243 |
6 | 33244220154521 |
7 | 3242603402212 |
oct | 534076330321 |
9 | 143537626004 |
10 | 46724133073 |
11 | 188a7611812 |
12 | 907b998a41 |
13 | 453818a127 |
14 | 2393637409 |
15 | 1336eac89d |
hex | ae0f9b0d1 |
46724133073 has 2 divisors, whose sum is σ = 46724133074. Its totient is φ = 46724133072.
The previous prime is 46724133037. The next prime is 46724133151. The reversal of 46724133073 is 37033142764.
46724133073 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (46724133037) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 42377104449 + 4347028624 = 205857^2 + 65932^2 .
It is a cyclic number.
It is not a de Polignac number, because 46724133073 - 29 = 46724132561 is a prime.
It is a super-2 number, since 2×467241330732 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (46724133473) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23362066536 + 23362066537.
It is an arithmetic number, because the mean of its divisors is an integer number (23362066537).
Almost surely, 246724133073 is an apocalyptic number.
It is an amenable number.
46724133073 is a deficient number, since it is larger than the sum of its proper divisors (1).
46724133073 is an equidigital number, since it uses as much as digits as its factorization.
46724133073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 254016, while the sum is 40.
The spelling of 46724133073 in words is "forty-six billion, seven hundred twenty-four million, one hundred thirty-three thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •