Base | Representation |
---|---|
bin | 10110000111110011110… |
… | …000110111110000001010 |
3 | 12101022221021012112201021 |
4 | 112013303300313300022 |
5 | 144401344030132000 |
6 | 3122213135143054 |
7 | 214555204254313 |
oct | 26076360676012 |
9 | 5338837175637 |
10 | 1520213130250 |
11 | 53679a753311 |
12 | 206764374a8a |
13 | b0480cc4ac9 |
14 | 53815d9160a |
15 | 29826bb511a |
hex | 161f3c37c0a |
1520213130250 has 16 divisors (see below), whose sum is σ = 2845838980296. Its totient is φ = 608085252000.
The previous prime is 1520213130217. The next prime is 1520213130253. The reversal of 1520213130250 is 520313120251.
It can be written as a sum of positive squares in 4 ways, for example, as 249491259081 + 1270721871169 = 499491^2 + 1127263^2 .
It is a super-2 number, since 2×15202131302502 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is not an unprimeable number, because it can be changed into a prime (1520213130253) 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, 3040426011 + ... + 3040426510.
Almost surely, 21520213130250 is an apocalyptic number.
1520213130250 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1520213130250 is a deficient number, since it is larger than the sum of its proper divisors (1325625850046).
1520213130250 is an equidigital number, since it uses as much as digits as its factorization.
1520213130250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6080852538 (or 6080852528 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 25.
Subtracting from 1520213130250 its reverse (520313120251), we obtain a palindrome (999900009999).
The spelling of 1520213130250 in words is "one trillion, five hundred twenty billion, two hundred thirteen million, one hundred thirty thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •