Base | Representation |
---|---|
bin | 1100101000100111010… |
… | …00011001001101010101 |
3 | 1112111112122100110100000 |
4 | 12110103220121031111 |
5 | 24103034442144023 |
6 | 531233224441513 |
7 | 43235632031454 |
oct | 6242350311525 |
9 | 1474478313300 |
10 | 434121053013 |
11 | 15812302056a |
12 | 70176319299 |
13 | 31c2572a13b |
14 | 17023a72b9b |
15 | b45c20a243 |
hex | 6513a19355 |
434121053013 has 24 divisors (see below), whose sum is σ = 650961158848. Its totient is φ = 289114588224.
The previous prime is 434121052973. The next prime is 434121053083. The reversal of 434121053013 is 310350121434.
It is a happy number.
434121053013 is a `hidden beast` number, since 4 + 3 + 4 + 121 + 0 + 530 + 1 + 3 = 666.
It is not a de Polignac number, because 434121053013 - 233 = 425531118421 is a prime.
It is a super-2 number, since 2×4341210530132 (a number of 24 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (434121053083) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 688756 + ... + 1158717.
Almost surely, 2434121053013 is an apocalyptic number.
It is an amenable number.
434121053013 is a deficient number, since it is larger than the sum of its proper divisors (216840105835).
434121053013 is an equidigital number, since it uses as much as digits as its factorization.
434121053013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1848455 (or 1848443 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
Adding to 434121053013 its reverse (310350121434), we get a palindrome (744471174447).
The spelling of 434121053013 in words is "four hundred thirty-four billion, one hundred twenty-one million, fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •