Base | Representation |
---|---|
bin | 110000011000110000101… |
… | …010100100010101011111 |
3 | 102202212201102002001210021 |
4 | 300120300222210111133 |
5 | 413434322003333401 |
6 | 11023312314053011 |
7 | 462142413311605 |
oct | 60306052442537 |
9 | 12685642061707 |
10 | 3325121152351 |
11 | 10721a3228609 |
12 | 45852041a167 |
13 | 1b17330035ab |
14 | b6d1851b875 |
15 | 5b7625572a1 |
hex | 30630aa455f |
3325121152351 has 64 divisors (see below), whose sum is σ = 3699218073600. Its totient is φ = 2976030720000.
The previous prime is 3325121152343. The next prime is 3325121152357. The reversal of 3325121152351 is 1532511215233.
It is a cyclic number.
It is not a de Polignac number, because 3325121152351 - 23 = 3325121152343 is a prime.
It is a super-2 number, since 2×33251211523512 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3325121152357) by changing a digit.
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 63 ways as a sum of consecutive naturals, for example, 1477173976 + ... + 1477176226.
It is an arithmetic number, because the mean of its divisors is an integer number (57800282400).
Almost surely, 23325121152351 is an apocalyptic number.
3325121152351 is a deficient number, since it is larger than the sum of its proper divisors (374096921249).
3325121152351 is a wasteful number, since it uses less digits than its factorization.
3325121152351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2720.
The product of its digits is 27000, while the sum is 34.
Adding to 3325121152351 its reverse (1532511215233), we get a palindrome (4857632367584).
The spelling of 3325121152351 in words is "three trillion, three hundred twenty-five billion, one hundred twenty-one million, one hundred fifty-two thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •