Base | Representation |
---|---|
bin | 11110001000001111111… |
… | …00111101101011011101 |
3 | 10122222002022002020121010 |
4 | 33010013330331223131 |
5 | 113430112424241000 |
6 | 2111323532525433 |
7 | 134535505255332 |
oct | 17040774755335 |
9 | 3588068066533 |
10 | 1035220540125 |
11 | 36a042008aa2 |
12 | 148771320879 |
13 | 7680c0b8a25 |
14 | 38167d60989 |
15 | 1bddd85bd50 |
hex | f107f3dadd |
1035220540125 has 16 divisors (see below), whose sum is σ = 1722606979392. Its totient is φ = 552117621200.
The previous prime is 1035220540063. The next prime is 1035220540141. The reversal of 1035220540125 is 5210450225301.
It is not a de Polignac number, because 1035220540125 - 214 = 1035220523741 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1035220540092 and 1035220540101.
It is a congruent number.
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, 1380293679 + ... + 1380294428.
It is an arithmetic number, because the mean of its divisors is an integer number (107662936212).
Almost surely, 21035220540125 is an apocalyptic number.
1035220540125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1035220540125 is a deficient number, since it is larger than the sum of its proper divisors (687386439267).
1035220540125 is an equidigital number, since it uses as much as digits as its factorization.
1035220540125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2760588125 (or 2760588115 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 30.
Adding to 1035220540125 its reverse (5210450225301), we get a palindrome (6245670765426).
The spelling of 1035220540125 in words is "one trillion, thirty-five billion, two hundred twenty million, five hundred forty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •