Base | Representation |
---|---|
bin | 10011101000010010010… |
… | …111101111110100111100 |
3 | 11202221211002220122021221 |
4 | 103220102113233310330 |
5 | 134100101023233134 |
6 | 2511404451203124 |
7 | 166312456233400 |
oct | 23502227576474 |
9 | 4687732818257 |
10 | 1348927946044 |
11 | 480093728238 |
12 | 1995212a64a4 |
13 | 9a284a1c5c3 |
14 | 49407773100 |
15 | 2514e6045b4 |
hex | 13a125efd3c |
1348927946044 has 36 divisors (see below), whose sum is σ = 2755804358160. Its totient is φ = 576054615360.
The previous prime is 1348927946039. The next prime is 1348927946077. The reversal of 1348927946044 is 4406497298431.
It is a Smith number, since the sum of its digits (61) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12190984 + ... + 12301135.
It is an arithmetic number, because the mean of its divisors is an integer number (76550121060).
Almost surely, 21348927946044 is an apocalyptic number.
1348927946044 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
1348927946044 is an abundant number, since it is smaller than the sum of its proper divisors (1406876412116).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1348927946044 is a wasteful number, since it uses less digits than its factorization.
1348927946044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24492418 (or 24492409 counting only the distinct ones).
The product of its (nonzero) digits is 41803776, while the sum is 61.
The spelling of 1348927946044 in words is "one trillion, three hundred forty-eight billion, nine hundred twenty-seven million, nine hundred forty-six thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •