Base | Representation |
---|---|
bin | 10100011110110011011110… |
… | …00001010001101010011011 |
3 | 12220110200020122211010121211 |
4 | 22033121233001101222123 |
5 | 21400404121223440243 |
6 | 235442325201243551 |
7 | 12325644446414632 |
oct | 1217315701215233 |
9 | 186420218733554 |
10 | 45038889671323 |
11 | 13394982070269 |
12 | 5074a090335b7 |
13 | 1c191c2685262 |
14 | b19c72ba2519 |
15 | 5318716edd9d |
hex | 28f66f051a9b |
45038889671323 has 4 divisors (see below), whose sum is σ = 45049269691720. Its totient is φ = 45028509650928.
The previous prime is 45038889671317. The next prime is 45038889671371. The reversal of 45038889671323 is 32317698883054.
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 45038889671323 - 29 = 45038889670811 is a prime.
It is a super-2 number, since 2×450388896713232 (a number of 28 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (45038889671393) 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, 5190003690 + ... + 5190012367.
It is an arithmetic number, because the mean of its divisors is an integer number (11262317422930).
It is a 1-persistent number, because it is pandigital, but 2⋅45038889671323 = 90077779342646 is not.
Almost surely, 245038889671323 is an apocalyptic number.
45038889671323 is a deficient number, since it is larger than the sum of its proper divisors (10380020397).
45038889671323 is a wasteful number, since it uses less digits than its factorization.
45038889671323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10380020396.
The product of its (nonzero) digits is 209018880, while the sum is 67.
The spelling of 45038889671323 in words is "forty-five trillion, thirty-eight billion, eight hundred eighty-nine million, six hundred seventy-one thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •