Base | Representation |
---|---|
bin | 1110101010111001111010… |
… | …0111100000011010110101 |
3 | 2010010001000210020202202201 |
4 | 3222232132213200122311 |
5 | 4103234234404244023 |
6 | 54150050215504501 |
7 | 3253241651161045 |
oct | 352563647403265 |
9 | 63101023222681 |
10 | 16130263353013 |
11 | 5159896169617 |
12 | 19861a0688131 |
13 | 900100ac9314 |
14 | 3da9cd37b725 |
15 | 1ce8b9e0ebad |
hex | eab9e9e06b5 |
16130263353013 has 4 divisors (see below), whose sum is σ = 16131663682560. Its totient is φ = 16128863023468.
The previous prime is 16130263353007. The next prime is 16130263353041. The reversal of 16130263353013 is 31035336203161.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-16130263353013 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (16130263353913) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 700147495 + ... + 700170532.
It is an arithmetic number, because the mean of its divisors is an integer number (4032915920640).
Almost surely, 216130263353013 is an apocalyptic number.
It is an amenable number.
16130263353013 is a deficient number, since it is larger than the sum of its proper divisors (1400329547).
16130263353013 is a wasteful number, since it uses less digits than its factorization.
16130263353013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1400329546.
The product of its (nonzero) digits is 87480, while the sum is 37.
Adding to 16130263353013 its reverse (31035336203161), we get a palindrome (47165599556174).
The spelling of 16130263353013 in words is "sixteen trillion, one hundred thirty billion, two hundred sixty-three million, three hundred fifty-three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •