Base | Representation |
---|---|
bin | 1010000011010111000… |
… | …00101101100101101011 |
3 | 1020000112121010221112222 |
4 | 11001223200231211223 |
5 | 21124340141334011 |
6 | 422401452424255 |
7 | 33645235042103 |
oct | 5015340554553 |
9 | 1200477127488 |
10 | 345401121131 |
11 | 123535a23610 |
12 | 56b3617808b |
13 | 26756b84721 |
14 | 12a08b88203 |
15 | 8eb8432ddb |
hex | 506b82d96b |
345401121131 has 16 divisors (see below), whose sum is σ = 378559116000. Its totient is φ = 312536928000.
The previous prime is 345401121101. The next prime is 345401121157. The reversal of 345401121131 is 131121104543.
It is not a de Polignac number, because 345401121131 - 222 = 345396926827 is a prime.
It is a super-2 number, since 2×3454011211312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 345401121131.
It is not an unprimeable number, because it can be changed into a prime (345401121101) 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 15 ways as a sum of consecutive naturals, for example, 9304295 + ... + 9341343.
It is an arithmetic number, because the mean of its divisors is an integer number (23659944750).
Almost surely, 2345401121131 is an apocalyptic number.
345401121131 is a deficient number, since it is larger than the sum of its proper divisors (33157994869).
345401121131 is a wasteful number, since it uses less digits than its factorization.
345401121131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40990.
The product of its (nonzero) digits is 1440, while the sum is 26.
Adding to 345401121131 its reverse (131121104543), we get a palindrome (476522225674).
The spelling of 345401121131 in words is "three hundred forty-five billion, four hundred one million, one hundred twenty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •