Base | Representation |
---|---|
bin | 10000101010110000010… |
… | …110100101100111111111 |
3 | 11001111112021211102222120 |
4 | 100222300112211213333 |
5 | 122231310010341111 |
6 | 2234110530014023 |
7 | 145516401313461 |
oct | 20526026454777 |
9 | 4044467742876 |
10 | 1145420012031 |
11 | 401851810319 |
12 | 165ba6a17313 |
13 | 84021a16739 |
14 | 3d61d82a131 |
15 | 1ebdd207406 |
hex | 10ab05a59ff |
1145420012031 has 8 divisors (see below), whose sum is σ = 1553111880960. Its totient is φ = 750670742232.
The previous prime is 1145420012027. The next prime is 1145420012069. The reversal of 1145420012031 is 1302100245411.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1145420012031 - 22 = 1145420012027 is a prime.
It is a super-2 number, since 2×11454200120312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1145420011992 and 1145420012010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1145420012131) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3235649575 + ... + 3235649928.
It is an arithmetic number, because the mean of its divisors is an integer number (194138985120).
Almost surely, 21145420012031 is an apocalyptic number.
1145420012031 is a deficient number, since it is larger than the sum of its proper divisors (407691868929).
1145420012031 is an equidigital number, since it uses as much as digits as its factorization.
1145420012031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6471299565.
The product of its (nonzero) digits is 960, while the sum is 24.
Adding to 1145420012031 its reverse (1302100245411), we get a palindrome (2447520257442).
The spelling of 1145420012031 in words is "one trillion, one hundred forty-five billion, four hundred twenty million, twelve thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •