Base | Representation |
---|---|
bin | 1011110110001010110001… |
… | …1110010000011000100010 |
3 | 1201010012101222120121120202 |
4 | 2331202230132100120202 |
5 | 3201401140010012200 |
6 | 43411413214305202 |
7 | 2513020311046310 |
oct | 275425436203042 |
9 | 51105358517522 |
10 | 13025234454050 |
11 | 4171a753115a5 |
12 | 15644647b8202 |
13 | 736374950330 |
14 | 3305d359d0b0 |
15 | 178c39c1c1d5 |
hex | bd8ac790622 |
13025234454050 has 96 divisors (see below), whose sum is σ = 29818920966912. Its totient is φ = 4122112538880.
The previous prime is 13025234454047. The next prime is 13025234454059. The reversal of 13025234454050 is 5045443252031.
It is a super-2 number, since 2×130252344540502 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13025234453995 and 13025234454013.
It is not an unprimeable number, because it can be changed into a prime (13025234454059) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 187047539 + ... + 187117161.
It is an arithmetic number, because the mean of its divisors is an integer number (310613760072).
Almost surely, 213025234454050 is an apocalyptic number.
13025234454050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
13025234454050 is an abundant number, since it is smaller than the sum of its proper divisors (16793686512862).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13025234454050 is a wasteful number, since it uses less digits than its factorization.
13025234454050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 110772 (or 110767 counting only the distinct ones).
The product of its (nonzero) digits is 288000, while the sum is 38.
The spelling of 13025234454050 in words is "thirteen trillion, twenty-five billion, two hundred thirty-four million, four hundred fifty-four thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •