Base | Representation |
---|---|
bin | 11110011011110000010… |
… | …01100100101010100011 |
3 | 10200222010010112121022222 |
4 | 33031320021210222203 |
5 | 114113034331001243 |
6 | 2120215030221255 |
7 | 135356146245653 |
oct | 17157011445243 |
9 | 3628103477288 |
10 | 1045692828323 |
11 | 373526382130 |
12 | 14a7b44b482b |
13 | 777ba8a7970 |
14 | 3887cb04363 |
15 | 1c302e0c168 |
hex | f378264aa3 |
1045692828323 has 8 divisors (see below), whose sum is σ = 1228506260016. Its totient is φ = 877504471200.
The previous prime is 1045692828283. The next prime is 1045692828329. The reversal of 1045692828323 is 3238282965401.
1045692828323 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1045692828323 - 224 = 1045676051107 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1045692828329) 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, 3656268488 + ... + 3656268773.
It is an arithmetic number, because the mean of its divisors is an integer number (153563282502).
Almost surely, 21045692828323 is an apocalyptic number.
1045692828323 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
1045692828323 is a deficient number, since it is larger than the sum of its proper divisors (182813431693).
1045692828323 is a wasteful number, since it uses less digits than its factorization.
1045692828323 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7312537285.
The product of its (nonzero) digits is 4976640, while the sum is 53.
The spelling of 1045692828323 in words is "one trillion, forty-five billion, six hundred ninety-two million, eight hundred twenty-eight thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •