Base | Representation |
---|---|
bin | 1010001011010100011… |
… | …01010111001110000000 |
3 | 1020102120101202211002010 |
4 | 11011222031113032000 |
5 | 21212113101120343 |
6 | 424345500252520 |
7 | 34156152663204 |
oct | 5055215271600 |
9 | 1212511684063 |
10 | 349674238848 |
11 | 125328aa0160 |
12 | 57929241140 |
13 | 26c8825104c |
14 | 12cd24b4b04 |
15 | 9168656d33 |
hex | 516a357380 |
349674238848 has 512 divisors, whose sum is σ = 1099097164800. Its totient is φ = 97418280960.
The previous prime is 349674238799. The next prime is 349674238919. The reversal of 349674238848 is 848832476943.
It is a Harshad number since it is a multiple of its sum of digits (66).
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 319920990 + ... + 319922082.
It is an arithmetic number, because the mean of its divisors is an integer number (2146674150).
Almost surely, 2349674238848 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 349674238848, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (549548582400).
349674238848 is an abundant number, since it is smaller than the sum of its proper divisors (749422925952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
349674238848 is a wasteful number, since it uses less digits than its factorization.
349674238848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1270 (or 1258 counting only the distinct ones).
The product of its digits is 222953472, while the sum is 66.
The spelling of 349674238848 in words is "three hundred forty-nine billion, six hundred seventy-four million, two hundred thirty-eight thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •