Base | Representation |
---|---|
bin | 100101100001010111011011… |
… | …1001100011000110100100100 |
3 | 1121021120122010212010222120112 |
4 | 1023002232313030120310210 |
5 | 321224343432310420302 |
6 | 3125534504403352152 |
7 | 126342456506263001 |
oct | 11302566714306444 |
9 | 1537518125128515 |
10 | 330041245404452 |
11 | 9618578496739a |
12 | 31024255382658 |
13 | 112209a992751a |
14 | 5b7011d93c8a8 |
15 | 28251e4628552 |
hex | 12c2bb7318d24 |
330041245404452 has 12 divisors (see below), whose sum is σ = 577672122772080. Its totient is φ = 164992067469576.
The previous prime is 330041245404449. The next prime is 330041245404457. The reversal of 330041245404452 is 254404542140033.
It is a super-2 number, since 2×3300412454044522 (a number of 30 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (330041245404457) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 7138782158 + ... + 7138828389.
It is an arithmetic number, because the mean of its divisors is an integer number (48139343564340).
Almost surely, 2330041245404452 is an apocalyptic number.
It is an amenable number.
330041245404452 is a deficient number, since it is larger than the sum of its proper divisors (247630877367628).
330041245404452 is a wasteful number, since it uses less digits than its factorization.
330041245404452 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14277616330 (or 14277616328 counting only the distinct ones).
The product of its (nonzero) digits is 921600, while the sum is 41.
Adding to 330041245404452 its reverse (254404542140033), we get a palindrome (584445787544485).
The spelling of 330041245404452 in words is "three hundred thirty trillion, forty-one billion, two hundred forty-five million, four hundred four thousand, four hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.115 sec. • engine limits •