Base | Representation |
---|---|
bin | 11110010111101100100… |
… | …10100010011101101000 |
3 | 10200202111021221210112010 |
4 | 33023312102202131220 |
5 | 114044104104444040 |
6 | 2115214521315520 |
7 | 135251152562325 |
oct | 17136622423550 |
9 | 3622437853463 |
10 | 1043514140520 |
11 | 3726085897a5 |
12 | 14a2a6935ba0 |
13 | 775313c8a97 |
14 | 38713613b4c |
15 | 1c2269eee80 |
hex | f2f64a2768 |
1043514140520 has 64 divisors (see below), whose sum is σ = 3131880531840. Its totient is φ = 278151494400.
The previous prime is 1043514140519. The next prime is 1043514140551. The reversal of 1043514140520 is 250414153401.
It is a super-2 number, since 2×10435141405202 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 1576396 + ... + 2138235.
It is an arithmetic number, because the mean of its divisors is an integer number (48935633310).
Almost surely, 21043514140520 is an apocalyptic number.
1043514140520 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1043514140520 is an abundant number, since it is smaller than the sum of its proper divisors (2088366391320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1043514140520 is a wasteful number, since it uses less digits than its factorization.
1043514140520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3716986 (or 3716982 counting only the distinct ones).
The product of its (nonzero) digits is 9600, while the sum is 30.
Adding to 1043514140520 its reverse (250414153401), we get a palindrome (1293928293921).
The spelling of 1043514140520 in words is "one trillion, forty-three billion, five hundred fourteen million, one hundred forty thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •