Base | Representation |
---|---|
bin | 1101110000101011111001… |
… | …0011100000110001100100 |
3 | 1222120102100102111012002212 |
4 | 3130022332103200301210 |
5 | 3440342334301240112 |
6 | 52102353533422552 |
7 | 3121053115443641 |
oct | 334127623406144 |
9 | 58512312435085 |
10 | 15130067602532 |
11 | 49036977a3473 |
12 | 184438503aa58 |
13 | 8599b41037bc |
14 | 3a4428d3adc8 |
15 | 1b387b3cd522 |
hex | dc2be4e0c64 |
15130067602532 has 6 divisors (see below), whose sum is σ = 26477618304438. Its totient is φ = 7565033801264.
The previous prime is 15130067602501. The next prime is 15130067602541. The reversal of 15130067602532 is 23520676003151.
It can be written as a sum of positive squares in only one way, i.e., 7891245066496 + 7238822536036 = 2809136^2 + 2690506^2 .
It is a super-2 number, since 2×151300676025322 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 15130067602532.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1891258450313 + ... + 1891258450320.
It is an arithmetic number, because the mean of its divisors is an integer number (4412936384073).
Almost surely, 215130067602532 is an apocalyptic number.
It is an amenable number.
15130067602532 is a deficient number, since it is larger than the sum of its proper divisors (11347550701906).
15130067602532 is a wasteful number, since it uses less digits than its factorization.
15130067602532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3782516900637 (or 3782516900635 counting only the distinct ones).
The product of its (nonzero) digits is 226800, while the sum is 41.
The spelling of 15130067602532 in words is "fifteen trillion, one hundred thirty billion, sixty-seven million, six hundred two thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •