Base | Representation |
---|---|
bin | 111100100011011111… |
… | …1101000010100010111 |
3 | 110102122201101202021010 |
4 | 1321012333220110113 |
5 | 4112310231313330 |
6 | 135423430423303 |
7 | 12252341435160 |
oct | 1710677502427 |
9 | 412581352233 |
10 | 130040104215 |
11 | 5017128100a |
12 | 21252201b33 |
13 | c3552a6938 |
14 | 6418948767 |
15 | 35b16363b0 |
hex | 1e46fe8517 |
130040104215 has 32 divisors (see below), whose sum is σ = 251775129600. Its totient is φ = 55950027264.
The previous prime is 130040104177. The next prime is 130040104241. The reversal of 130040104215 is 512401040031.
It is not a de Polignac number, because 130040104215 - 28 = 130040103959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 130040104191 and 130040104200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36424015 + ... + 36427584.
It is an arithmetic number, because the mean of its divisors is an integer number (7867972800).
Almost surely, 2130040104215 is an apocalyptic number.
130040104215 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
130040104215 is a deficient number, since it is larger than the sum of its proper divisors (121735025385).
130040104215 is a wasteful number, since it uses less digits than its factorization.
130040104215 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72851631.
The product of its (nonzero) digits is 480, while the sum is 21.
Adding to 130040104215 its reverse (512401040031), we get a palindrome (642441144246).
The spelling of 130040104215 in words is "one hundred thirty billion, forty million, one hundred four thousand, two hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •