Base | Representation |
---|---|
bin | 1001011010100100010111… |
… | …1011000110000101010000 |
3 | 1100122122102202200210021010 |
4 | 2112221011323012011100 |
5 | 2324101441320141142 |
6 | 34003355152130520 |
7 | 2115624210502542 |
oct | 226510573060520 |
9 | 40578382623233 |
10 | 10352044302672 |
11 | 333130614a206 |
12 | 11b2366836a40 |
13 | 5a12694132a7 |
14 | 27b0822ad692 |
15 | 12e4316aae9c |
hex | 96a45ec6150 |
10352044302672 has 80 divisors (see below), whose sum is σ = 27205596908928. Its totient is φ = 3391299717120.
The previous prime is 10352044302667. The next prime is 10352044302697. The reversal of 10352044302672 is 27620344025301.
It is a self number, because there is not a number n which added to its sum of digits gives 10352044302672.
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 15 ways as a sum of consecutive naturals, for example, 4272228 + ... + 6241475.
Almost surely, 210352044302672 is an apocalyptic number.
10352044302672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
10352044302672 is an abundant number, since it is smaller than the sum of its proper divisors (16853552606256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10352044302672 is a wasteful number, since it uses less digits than its factorization.
10352044302672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10514068 (or 10514062 counting only the distinct ones).
The product of its (nonzero) digits is 241920, while the sum is 39.
Adding to 10352044302672 its reverse (27620344025301), we get a palindrome (37972388327973).
The spelling of 10352044302672 in words is "ten trillion, three hundred fifty-two billion, forty-four million, three hundred two thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •