Base | Representation |
---|---|
bin | 10000011110010001111… |
… | …111000011101101010111 |
3 | 11000012221210221002210222 |
4 | 100132101333003231113 |
5 | 122021342030003211 |
6 | 2224013445504555 |
7 | 144533436023621 |
oct | 20362177035527 |
9 | 4005853832728 |
10 | 1132025625431 |
11 | 3a70a8a54428 |
12 | 16348911215b |
13 | 82998a1a4ac |
14 | 3cb0c95bc11 |
15 | 1e6a73501db |
hex | 10791fc3b57 |
1132025625431 has 16 divisors (see below), whose sum is σ = 1154451916800. Its totient is φ = 1109822879520.
The previous prime is 1132025625421. The next prime is 1132025625433. The reversal of 1132025625431 is 1345265202311.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1132025625431 is a prime.
It is a super-2 number, since 2×11320256254312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1132025625391 and 1132025625400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1132025625433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 13103066 + ... + 13189176.
It is an arithmetic number, because the mean of its divisors is an integer number (72153244800).
Almost surely, 21132025625431 is an apocalyptic number.
1132025625431 is a deficient number, since it is larger than the sum of its proper divisors (22426291369).
1132025625431 is a wasteful number, since it uses less digits than its factorization.
1132025625431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87406.
The product of its (nonzero) digits is 43200, while the sum is 35.
The spelling of 1132025625431 in words is "one trillion, one hundred thirty-two billion, twenty-five million, six hundred twenty-five thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •