Base | Representation |
---|---|
bin | 110100101100001011… |
… | …0110101110100100001 |
3 | 101211001201120101222101 |
4 | 1221120112311310201 |
5 | 3323213243013241 |
6 | 123551530010401 |
7 | 11114000104222 |
oct | 1513026656441 |
9 | 354051511871 |
10 | 113151532321 |
11 | 43a950a9a83 |
12 | 19b1a276a01 |
13 | a8933c8929 |
14 | 5695993249 |
15 | 2e23b1ee31 |
hex | 1a585b5d21 |
113151532321 has 2 divisors, whose sum is σ = 113151532322. Its totient is φ = 113151532320.
The previous prime is 113151532303. The next prime is 113151532331. The reversal of 113151532321 is 123235151311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 93012800400 + 20138731921 = 304980^2 + 141911^2 .
It is a cyclic number.
It is not a de Polignac number, because 113151532321 - 215 = 113151499553 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 113151532321.
It is not a weakly prime, because it can be changed into another prime (113151532331) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56575766160 + 56575766161.
It is an arithmetic number, because the mean of its divisors is an integer number (56575766161).
Almost surely, 2113151532321 is an apocalyptic number.
It is an amenable number.
113151532321 is a deficient number, since it is larger than the sum of its proper divisors (1).
113151532321 is an equidigital number, since it uses as much as digits as its factorization.
113151532321 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2700, while the sum is 28.
Adding to 113151532321 its reverse (123235151311), we get a palindrome (236386683632).
The spelling of 113151532321 in words is "one hundred thirteen billion, one hundred fifty-one million, five hundred thirty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •