Base | Representation |
---|---|
bin | 11110100110100101001… |
… | …00110001001101101001 |
3 | 10201112010011221010121202 |
4 | 33103102210301031221 |
5 | 114211440221434340 |
6 | 2123015450413545 |
7 | 135653161650362 |
oct | 17232244611551 |
9 | 3645104833552 |
10 | 1051504874345 |
11 | 375a390a8352 |
12 | 14b956a312b5 |
13 | 78205a46353 |
14 | 38c70988b69 |
15 | 1c5432b9c15 |
hex | f4d2931369 |
1051504874345 has 16 divisors (see below), whose sum is σ = 1288695944448. Its totient is φ = 823278368640.
The previous prime is 1051504874327. The next prime is 1051504874369. The reversal of 1051504874345 is 5434784051501.
1051504874345 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1051504874345 - 214 = 1051504857961 is a prime.
It is a super-2 number, since 2×10515048743452 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (47).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1051504874345.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9618482 + ... + 9727188.
It is an arithmetic number, because the mean of its divisors is an integer number (80543496528).
Almost surely, 21051504874345 is an apocalyptic number.
It is an amenable number.
1051504874345 is a deficient number, since it is larger than the sum of its proper divisors (237191070103).
1051504874345 is a wasteful number, since it uses less digits than its factorization.
1051504874345 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 149920.
The product of its (nonzero) digits is 1344000, while the sum is 47.
The spelling of 1051504874345 in words is "one trillion, fifty-one billion, five hundred four million, eight hundred seventy-four thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •