Base | Representation |
---|---|
bin | 11110011010101101001… |
… | …10101101111101010110 |
3 | 10200220122220120011022100 |
4 | 33031112212231331112 |
5 | 114110411242340342 |
6 | 2120043123542530 |
7 | 135336203535036 |
oct | 17152646557526 |
9 | 3626586504270 |
10 | 1045130043222 |
11 | 373267732381 |
12 | 14a677b2aa46 |
13 | 7772b10c025 |
14 | 388280878c6 |
15 | 1c2bd7e0e4c |
hex | f3569adf56 |
1045130043222 has 96 divisors (see below), whose sum is σ = 2368364544000. Its totient is φ = 332691053760.
The previous prime is 1045130043193. The next prime is 1045130043323. The reversal of 1045130043222 is 2223400315401.
1045130043222 is a `hidden beast` number, since 104 + 513 + 0 + 0 + 43 + 2 + 2 + 2 = 666.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 98694304 + ... + 98704892.
It is an arithmetic number, because the mean of its divisors is an integer number (24670464000).
Almost surely, 21045130043222 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1045130043222, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1184182272000).
1045130043222 is an abundant number, since it is smaller than the sum of its proper divisors (1323234500778).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1045130043222 is a wasteful number, since it uses less digits than its factorization.
1045130043222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12946 (or 12943 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
Adding to 1045130043222 its reverse (2223400315401), we get a palindrome (3268530358623).
The spelling of 1045130043222 in words is "one trillion, forty-five billion, one hundred thirty million, forty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •