Base | Representation |
---|---|
bin | 11000101101000101… |
… | …11000111000000101 |
3 | 1021020022221122121012 |
4 | 30112202320320011 |
5 | 204130331142001 |
6 | 10032031132005 |
7 | 646446612413 |
oct | 142642707005 |
9 | 37208848535 |
10 | 13263146501 |
11 | 5696778300 |
12 | 26a1974005 |
13 | 1334a681a7 |
14 | 8db6a82b3 |
15 | 5295d12bb |
hex | 3168b8e05 |
13263146501 has 6 divisors (see below), whose sum is σ = 14578500006. Its totient is φ = 12057405800.
The previous prime is 13263146461. The next prime is 13263146521. The reversal of 13263146501 is 10564136231.
It can be written as a sum of positive squares in only one way, i.e., 13253995876 + 9150625 = 115126^2 + 3025^2 .
It is not a de Polignac number, because 13263146501 - 230 = 12189404677 is a prime.
It is a super-2 number, since 2×132631465012 (a number of 21 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 (13263146521) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 54806270 + ... + 54806511.
It is an arithmetic number, because the mean of its divisors is an integer number (2429750001).
Almost surely, 213263146501 is an apocalyptic number.
13263146501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13263146501 is a deficient number, since it is larger than the sum of its proper divisors (1315353505).
13263146501 is a wasteful number, since it uses less digits than its factorization.
13263146501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 109612803 (or 109612792 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 32.
The spelling of 13263146501 in words is "thirteen billion, two hundred sixty-three million, one hundred forty-six thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •