Base | Representation |
---|---|
bin | 1100101000111100111… |
… | …10110111100001101011 |
3 | 1112112000022220122220001 |
4 | 12110132132313201223 |
5 | 24103423043331011 |
6 | 531303250443431 |
7 | 43243302324610 |
oct | 6243636674153 |
9 | 1475008818801 |
10 | 434303105131 |
11 | 158206864a65 |
12 | 70207293577 |
13 | 31c5436c09c |
14 | 1703dd02507 |
15 | b46d1bb7c1 |
hex | 651e7b786b |
434303105131 has 16 divisors (see below), whose sum is σ = 496732824000. Its totient is φ = 371970137088.
The previous prime is 434303105081. The next prime is 434303105179. The reversal of 434303105131 is 131501303434.
It is a cyclic number.
It is not a de Polignac number, because 434303105131 - 27 = 434303105003 is a prime.
It is a super-2 number, since 2×4343031051312 (a number of 24 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 434303105131.
It is not an unprimeable number, because it can be changed into a prime (434303105191) 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 15 ways as a sum of consecutive naturals, for example, 83694285 + ... + 83699473.
It is an arithmetic number, because the mean of its divisors is an integer number (31045801500).
Almost surely, 2434303105131 is an apocalyptic number.
434303105131 is a deficient number, since it is larger than the sum of its proper divisors (62429718869).
434303105131 is a wasteful number, since it uses less digits than its factorization.
434303105131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12198.
The product of its (nonzero) digits is 6480, while the sum is 28.
Adding to 434303105131 its reverse (131501303434), we get a palindrome (565804408565).
The spelling of 434303105131 in words is "four hundred thirty-four billion, three hundred three million, one hundred five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •