Base | Representation |
---|---|
bin | 10011010011011001… |
… | …01010111010101101 |
3 | 222202020021202201212 |
4 | 21221230222322231 |
5 | 132210443034042 |
6 | 4432200244205 |
7 | 514545122561 |
oct | 115154527255 |
9 | 28666252655 |
10 | 10363252397 |
11 | 4438870a03 |
12 | 2012770665 |
13 | c92033714 |
14 | 7044bd6a1 |
15 | 409c13482 |
hex | 269b2aead |
10363252397 has 2 divisors, whose sum is σ = 10363252398. Its totient is φ = 10363252396.
The previous prime is 10363252391. The next prime is 10363252409. The reversal of 10363252397 is 79325236301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10022812996 + 340439401 = 100114^2 + 18451^2 .
It is a cyclic number.
It is not a de Polignac number, because 10363252397 - 24 = 10363252381 is a prime.
It is a super-3 number, since 3×103632523973 (a number of 31 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10363252391) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5181626198 + 5181626199.
It is an arithmetic number, because the mean of its divisors is an integer number (5181626199).
Almost surely, 210363252397 is an apocalyptic number.
It is an amenable number.
10363252397 is a deficient number, since it is larger than the sum of its proper divisors (1).
10363252397 is an equidigital number, since it uses as much as digits as its factorization.
10363252397 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 204120, while the sum is 41.
Adding to 10363252397 its reverse (79325236301), we get a palindrome (89688488698).
The spelling of 10363252397 in words is "ten billion, three hundred sixty-three million, two hundred fifty-two thousand, three hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •