Base | Representation |
---|---|
bin | 1100000101000001011… |
… | …00111101001101000000 |
3 | 1110200012222011210022212 |
4 | 12002200230331031000 |
5 | 23244421312000000 |
6 | 514353200521252 |
7 | 41661260203214 |
oct | 6024054751500 |
9 | 1420188153285 |
10 | 415013000000 |
11 | 150008023515 |
12 | 68523020228 |
13 | 3019ba895b1 |
14 | 1613000c944 |
15 | abde929c35 |
hex | 60a0b3d340 |
415013000000 has 98 divisors (see below), whose sum is σ = 1029416081118. Its totient is φ = 166004800000.
The previous prime is 415012999969. The next prime is 415013000023. The reversal of 415013000000 is 310514.
It can be written as a sum of positive squares in 7 ways, for example, as 383983472896 + 31029527104 = 619664^2 + 176152^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 13 ways as a sum of consecutive naturals, for example, 792494 + ... + 1207506.
Almost surely, 2415013000000 is an apocalyptic number.
415013000000 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 415013000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (514708040559).
415013000000 is an abundant number, since it is smaller than the sum of its proper divisors (614403081118).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
415013000000 is an frugal number, since it uses more digits than its factorization.
415013000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 415055 (or 415020 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 14.
Adding to 415013000000 its reverse (310514), we get a palindrome (415013310514).
The spelling of 415013000000 in words is "four hundred fifteen billion, thirteen million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •