Base | Representation |
---|---|
bin | 111100100011010101… |
… | …0010111101011100001 |
3 | 110102122022220121022021 |
4 | 1321012222113223201 |
5 | 4112302314443131 |
6 | 135423111141441 |
7 | 12252243163642 |
oct | 1710652275341 |
9 | 412568817267 |
10 | 130034531041 |
11 | 50169114888 |
12 | 21250374881 |
13 | c3540a4cbc |
14 | 6417cd76c9 |
15 | 35b0dd4e11 |
hex | 1e46a97ae1 |
130034531041 has 8 divisors (see below), whose sum is σ = 131458199400. Its totient is φ = 128615057280.
The previous prime is 130034531027. The next prime is 130034531059. The reversal of 130034531041 is 140135430031.
It can be written as a sum of positive squares in 4 ways, for example, as 12988816 + 130021542225 = 3604^2 + 360585^2 .
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 130034531041 - 25 = 130034531009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130034530997 and 130034531015.
It is not an unprimeable number, because it can be changed into a prime (130034531741) 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, 986290 + ... + 1110331.
It is an arithmetic number, because the mean of its divisors is an integer number (16432274925).
Almost surely, 2130034531041 is an apocalyptic number.
It is an amenable number.
130034531041 is a deficient number, since it is larger than the sum of its proper divisors (1423668359).
130034531041 is a wasteful number, since it uses less digits than its factorization.
130034531041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2097299.
The product of its (nonzero) digits is 2160, while the sum is 25.
Adding to 130034531041 its reverse (140135430031), we get a palindrome (270169961072).
The spelling of 130034531041 in words is "one hundred thirty billion, thirty-four million, five hundred thirty-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •