Base | Representation |
---|---|
bin | 1011111101101010011110… |
… | …1100000110001011001010 |
3 | 1201120111210002201102211010 |
4 | 2333122213230012023022 |
5 | 3211003344310340200 |
6 | 43550510551544350 |
7 | 2525226314336505 |
oct | 277324754061312 |
9 | 51514702642733 |
10 | 13154003215050 |
11 | 4211643988635 |
12 | 158540108b0b6 |
13 | 745556713779 |
14 | 33692b32613c |
15 | 17c274924150 |
hex | bf6a7b062ca |
13154003215050 has 48 divisors (see below), whose sum is σ = 32745965820480. Its totient is φ = 3494396787840.
The previous prime is 13154003215039. The next prime is 13154003215097. The reversal of 13154003215050 is 5051230045131.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 13154003214999 and 13154003215017.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 166677955 + ... + 166756854.
It is an arithmetic number, because the mean of its divisors is an integer number (682207621260).
Almost surely, 213154003215050 is an apocalyptic number.
13154003215050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13154003215050 is an abundant number, since it is smaller than the sum of its proper divisors (19591962605430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13154003215050 is a wasteful number, since it uses less digits than its factorization.
13154003215050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 333435087 (or 333435082 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 30.
The spelling of 13154003215050 in words is "thirteen trillion, one hundred fifty-four billion, three million, two hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.786 sec. • engine limits •