Base | Representation |
---|---|
bin | 11110011001100111000… |
… | …11100001010101100011 |
3 | 10200212010221001121010111 |
4 | 33030303203201111203 |
5 | 114103210223040111 |
6 | 2115504520112151 |
7 | 135315503345506 |
oct | 17146343412543 |
9 | 3625127047114 |
10 | 1044542002531 |
11 | 372a95802735 |
12 | 14a533005657 |
13 | 7766633ca61 |
14 | 387add3513d |
15 | 1c286d86a21 |
hex | f3338e1563 |
1044542002531 has 4 divisors (see below), whose sum is σ = 1045170111232. Its totient is φ = 1043913893832.
The previous prime is 1044542002529. The next prime is 1044542002577. The reversal of 1044542002531 is 1352002454401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1044542002531 - 21 = 1044542002529 is a prime.
It is a super-2 number, since 2×10445420025312 (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 = 1044542002493 and 1044542002502.
It is not an unprimeable number, because it can be changed into a prime (1044542002501) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 314051856 + ... + 314055181.
It is an arithmetic number, because the mean of its divisors is an integer number (261292527808).
Almost surely, 21044542002531 is an apocalyptic number.
1044542002531 is a deficient number, since it is larger than the sum of its proper divisors (628108701).
1044542002531 is an equidigital number, since it uses as much as digits as its factorization.
1044542002531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 628108700.
The product of its (nonzero) digits is 19200, while the sum is 31.
Adding to 1044542002531 its reverse (1352002454401), we get a palindrome (2396544456932).
The spelling of 1044542002531 in words is "one trillion, forty-four billion, five hundred forty-two million, two thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •