Base | Representation |
---|---|
bin | 101001101110011… |
… | …0111010011010010 |
3 | 10121120111012111012 |
4 | 1103130313103102 |
5 | 10331404403344 |
6 | 350532250522 |
7 | 46460305460 |
oct | 12334672322 |
9 | 3546435435 |
10 | 1400075474 |
11 | 659340476 |
12 | 330a70a42 |
13 | 1940a6c35 |
14 | d3d31830 |
15 | 82dac29e |
hex | 537374d2 |
1400075474 has 8 divisors (see below), whose sum is σ = 2400129408. Its totient is φ = 600032340.
The previous prime is 1400075437. The next prime is 1400075489. The reversal of 1400075474 is 4745700041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-3 number, since 3×14000754743 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 1400075474.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50002682 + ... + 50002709.
It is an arithmetic number, because the mean of its divisors is an integer number (300016176).
Almost surely, 21400075474 is an apocalyptic number.
1400075474 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
1400075474 is a deficient number, since it is larger than the sum of its proper divisors (1000053934).
1400075474 is a wasteful number, since it uses less digits than its factorization.
1400075474 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100005400.
The product of its (nonzero) digits is 15680, while the sum is 32.
The square root of 1400075474 is about 37417.5824178955. The cubic root of 1400075474 is about 1118.7090445604.
The spelling of 1400075474 in words is "one billion, four hundred million, seventy-five thousand, four hundred seventy-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •