Base | Representation |
---|---|
bin | 111110110101111… |
… | …101000101001110 |
3 | 2201110220120112020 |
4 | 332311331011032 |
5 | 4124402044324 |
6 | 252341551010 |
7 | 35061444636 |
oct | 7665750516 |
9 | 2643816466 |
10 | 1054331214 |
11 | 4a1162712 |
12 | 255115466 |
13 | 13a580b31 |
14 | a00516c6 |
15 | 62864679 |
hex | 3ed7d14e |
1054331214 has 8 divisors (see below), whose sum is σ = 2108662440. Its totient is φ = 351443736.
The previous prime is 1054331203. The next prime is 1054331227. The reversal of 1054331214 is 4121334501.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1054331214 is an admirable number.
It is a super-2 number, since 2×10543312142 = 2223228617629427592, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
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 3 ways as a sum of consecutive naturals, for example, 87860929 + ... + 87860940.
It is an arithmetic number, because the mean of its divisors is an integer number (263582805).
Almost surely, 21054331214 is an apocalyptic number.
1054331214 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1054331214 is a wasteful number, since it uses less digits than its factorization.
1054331214 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175721874.
The product of its (nonzero) digits is 1440, while the sum is 24.
The square root of 1054331214 is about 32470.4667967678. The cubic root of 1054331214 is about 1017.7919729886.
Adding to 1054331214 its reverse (4121334501), we get a palindrome (5175665715).
The spelling of 1054331214 in words is "one billion, fifty-four million, three hundred thirty-one thousand, two hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •