Base | Representation |
---|---|
bin | 101001101100011… |
… | …1101101111101100 |
3 | 10121111120021022121 |
4 | 1103120331233230 |
5 | 10331124201132 |
6 | 350454322324 |
7 | 46445520400 |
oct | 12330755754 |
9 | 3544507277 |
10 | 1399053292 |
11 | 65880249a |
12 | 3306593a4 |
13 | 193b098b0 |
14 | d3b47100 |
15 | 82c59497 |
hex | 5363dbec |
1399053292 has 72 divisors (see below), whose sum is σ = 3200643936. Its totient is φ = 529385472.
The previous prime is 1399053247. The next prime is 1399053319. The reversal of 1399053292 is 2923509931.
It is a super-2 number, since 2×13990532922 = 3914700227712074528, which contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 46668 + ... + 70540.
It is an arithmetic number, because the mean of its divisors is an integer number (44453388).
Almost surely, 21399053292 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1399053292, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1600321968).
1399053292 is an abundant number, since it is smaller than the sum of its proper divisors (1801590644).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1399053292 is a wasteful number, since it uses less digits than its factorization.
1399053292 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23927 (or 23918 counting only the distinct ones).
The product of its (nonzero) digits is 131220, while the sum is 43.
The square root of 1399053292 is about 37403.9208105247. The cubic root of 1399053292 is about 1118.4367252760.
The spelling of 1399053292 in words is "one billion, three hundred ninety-nine million, fifty-three thousand, two hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •