Base | Representation |
---|---|
bin | 110000001101101010111… |
… | …001000111010110100000 |
3 | 102201201222112001111002212 |
4 | 300031222321013112200 |
5 | 413240430031024212 |
6 | 11014022532101252 |
7 | 461241340016534 |
oct | 60155271072640 |
9 | 12651875044085 |
10 | 3313213142432 |
11 | 10681424974a6 |
12 | 456158464828 |
13 | 1b0585c3978b |
14 | b6508c07bc4 |
15 | 5b2b6e07e22 |
hex | 3036ae475a0 |
3313213142432 has 96 divisors (see below), whose sum is σ = 6646578301440. Its totient is φ = 1625545635840.
The previous prime is 3313213142413. The next prime is 3313213142441. The reversal of 3313213142432 is 2342413123133.
It is a Harshad number since it is a multiple of its sum of digits (32).
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, 205947893 + ... + 205963979.
It is an arithmetic number, because the mean of its divisors is an integer number (69235190640).
Almost surely, 23313213142432 is an apocalyptic number.
3313213142432 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3313213142432 is an abundant number, since it is smaller than the sum of its proper divisors (3333365159008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
3313213142432 is a wasteful number, since it uses less digits than its factorization.
3313213142432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16774 (or 16766 counting only the distinct ones).
The product of its digits is 31104, while the sum is 32.
Adding to 3313213142432 its reverse (2342413123133), we get a palindrome (5655626265565).
The spelling of 3313213142432 in words is "three trillion, three hundred thirteen billion, two hundred thirteen million, one hundred forty-two thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •