Base | Representation |
---|---|
bin | 1010101101110001000… |
… | …11000101001101010000 |
3 | 1022012022021211210001122 |
4 | 11112320203011031100 |
5 | 22013002104034042 |
6 | 441044555021412 |
7 | 35412361654145 |
oct | 5267043051520 |
9 | 1265267753048 |
10 | 368168424272 |
11 | 132159528420 |
12 | 5b42aa3a868 |
13 | 2894497bc2c |
14 | 13b687c23cc |
15 | 989c0ca7d2 |
hex | 55b88c5350 |
368168424272 has 80 divisors (see below), whose sum is σ = 821607889920. Its totient is φ = 158061974400.
The previous prime is 368168424271. The next prime is 368168424287. The reversal of 368168424272 is 272424861863.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (368168424271) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 940553 + ... + 1273175.
It is an arithmetic number, because the mean of its divisors is an integer number (10270098624).
Almost surely, 2368168424272 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 368168424272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (410803944960).
368168424272 is an abundant number, since it is smaller than the sum of its proper divisors (453439465648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
368168424272 is a wasteful number, since it uses less digits than its factorization.
368168424272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 332992 (or 332986 counting only the distinct ones).
The product of its digits is 6193152, while the sum is 53.
The spelling of 368168424272 in words is "three hundred sixty-eight billion, one hundred sixty-eight million, four hundred twenty-four thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •