Base | Representation |
---|---|
bin | 100110000000100… |
… | …1011110101000110 |
3 | 10021212211222002210 |
4 | 1030001023311012 |
5 | 10102444112024 |
6 | 330315444250 |
7 | 43414354110 |
oct | 11401136506 |
9 | 3255758083 |
10 | 1275379014 |
11 | 5a4a11148 |
12 | 2b7156686 |
13 | 1742c7450 |
14 | c15523b0 |
15 | 76e7a129 |
hex | 4c04bd46 |
1275379014 has 64 divisors (see below), whose sum is σ = 3143508480. Its totient is φ = 335923200.
The previous prime is 1275379013. The next prime is 1275379019. The reversal of 1275379014 is 4109735721.
It is a super-2 number, since 2×12753790142 = 3253183258703224392, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1275379013) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 795814 + ... + 797414.
It is an arithmetic number, because the mean of its divisors is an integer number (49117320).
Almost surely, 21275379014 is an apocalyptic number.
1275379014 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1275379014 is an abundant number, since it is smaller than the sum of its proper divisors (1868129466).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1275379014 is a wasteful number, since it uses less digits than its factorization.
1275379014 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3085.
The product of its (nonzero) digits is 52920, while the sum is 39.
The square root of 1275379014 is about 35712.4490059139. The cubic root of 1275379014 is about 1084.4588788762.
The spelling of 1275379014 in words is "one billion, two hundred seventy-five million, three hundred seventy-nine thousand, fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •