Base | Representation |
---|---|
bin | 101101011100101110000… |
… | …101001000000110100000 |
3 | 102001120120011202021002122 |
4 | 231130232011020012200 |
5 | 402132320331220112 |
6 | 10350441310003412 |
7 | 441434106460652 |
oct | 55345605100640 |
9 | 12046504667078 |
10 | 3123214320032 |
11 | aa4603075034 |
12 | 4253721a6568 |
13 | 19869692aa91 |
14 | ab2430b46d2 |
15 | 563969c5872 |
hex | 2d72e1481a0 |
3123214320032 has 12 divisors (see below), whose sum is σ = 6148828192626. Its totient is φ = 1561607160000.
The previous prime is 3123214319957. The next prime is 3123214320041. The reversal of 3123214320032 is 2300234123213.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 2316228311056 + 806986008976 = 1521916^2 + 898324^2 .
It is a junction number, because it is equal to n+sod(n) for n = 3123214319983 and 3123214320010.
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 as a sum of consecutive naturals, namely, 48800223719 + ... + 48800223782.
Almost surely, 23123214320032 is an apocalyptic number.
3123214320032 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
3123214320032 is a deficient number, since it is larger than the sum of its proper divisors (3025613872594).
3123214320032 is an equidigital number, since it uses as much as digits as its factorization.
3123214320032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97600447511 (or 97600447503 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 26.
Adding to 3123214320032 its reverse (2300234123213), we get a palindrome (5423448443245).
The spelling of 3123214320032 in words is "three trillion, one hundred twenty-three billion, two hundred fourteen million, three hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •