Base | Representation |
---|---|
bin | 11101101000110001010101… |
… | …011000100111011101010011 |
3 | 122002111212111010120110222021 |
4 | 131220301111120213131103 |
5 | 114041033231100443233 |
6 | 1141115413504552311 |
7 | 36312060042350455 |
oct | 3550612530473523 |
9 | 562455433513867 |
10 | 130345100015443 |
11 | 38594056961665 |
12 | 12751906322697 |
13 | 579664ac42761 |
14 | 2428a44d662d5 |
15 | 101089634ee2d |
hex | 768c55627753 |
130345100015443 has 8 divisors (see below), whose sum is σ = 136027924669728. Its totient is φ = 124663579227264.
The previous prime is 130345100015413. The next prime is 130345100015453. The reversal of 130345100015443 is 344510001543031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130345100015443 - 241 = 128146076759891 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 130345100015399 and 130345100015408.
It is not an unprimeable number, because it can be changed into a prime (130345100015413) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 325762230 + ... + 326162107.
It is an arithmetic number, because the mean of its divisors is an integer number (17003490583716).
Almost surely, 2130345100015443 is an apocalyptic number.
130345100015443 is a deficient number, since it is larger than the sum of its proper divisors (5682824654285).
130345100015443 is an equidigital number, since it uses as much as digits as its factorization.
130345100015443 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 651933053.
The product of its (nonzero) digits is 43200, while the sum is 34.
Adding to 130345100015443 its reverse (344510001543031), we get a palindrome (474855101558474).
The spelling of 130345100015443 in words is "one hundred thirty trillion, three hundred forty-five billion, one hundred million, fifteen thousand, four hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.242 sec. • engine limits •