Base | Representation |
---|---|
bin | 1101101010111000010001… |
… | …1111111011011010000101 |
3 | 1222012212212101121022022102 |
4 | 3122232010133323122011 |
5 | 3432224040230443023 |
6 | 51544455233441445 |
7 | 3110622116022044 |
oct | 332560437733205 |
9 | 58185771538272 |
10 | 15030313531013 |
11 | 4875358170050 |
12 | 1828b85710285 |
13 | 85047753c491 |
14 | 39d68481655b |
15 | 1b0e8da71628 |
hex | dab847fb685 |
15030313531013 has 8 divisors (see below), whose sum is σ = 16400133849216. Its totient is φ = 13661064576000.
The previous prime is 15030313531001. The next prime is 15030313531021. The reversal of 15030313531013 is 31013531303051.
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 15030313531013 - 218 = 15030313268869 is a prime.
It is a super-2 number, since 2×150303135310132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (15030313531033) 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, 142785788 + ... + 142891013.
It is an arithmetic number, because the mean of its divisors is an integer number (2050016731152).
Almost surely, 215030313531013 is an apocalyptic number.
It is an amenable number.
15030313531013 is a deficient number, since it is larger than the sum of its proper divisors (1369820318203).
15030313531013 is a wasteful number, since it uses less digits than its factorization.
15030313531013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 285681595.
The product of its (nonzero) digits is 6075, while the sum is 29.
Adding to 15030313531013 its reverse (31013531303051), we get a palindrome (46043844834064).
The spelling of 15030313531013 in words is "fifteen trillion, thirty billion, three hundred thirteen million, five hundred thirty-one thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •