Base | Representation |
---|---|
bin | 10000010101000… |
… | …00001001110001 |
3 | 100112201211201000 |
4 | 20022200021301 |
5 | 240031031430 |
6 | 21331432213 |
7 | 3252142653 |
oct | 1012401161 |
9 | 315654630 |
10 | 136970865 |
11 | 70353269 |
12 | 39a55669 |
13 | 224b9665 |
14 | 142966d3 |
15 | c058e60 |
hex | 82a0271 |
136970865 has 64 divisors (see below), whose sum is σ = 262471680. Its totient is φ = 67573440.
The previous prime is 136970863. The next prime is 136970893. The reversal of 136970865 is 568079631.
It is a happy number.
It is not a de Polignac number, because 136970865 - 21 = 136970863 is a prime.
It is a super-2 number, since 2×1369708652 = 37522035717696450, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a self number, because there is not a number n which added to its sum of digits gives 136970865.
It is not an unprimeable number, because it can be changed into a prime (136970863) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 95544 + ... + 96966.
It is an arithmetic number, because the mean of its divisors is an integer number (4101120).
Almost surely, 2136970865 is an apocalyptic number.
136970865 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
136970865 is a deficient number, since it is larger than the sum of its proper divisors (125500815).
136970865 is a wasteful number, since it uses less digits than its factorization.
136970865 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1491 (or 1485 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 45.
The square root of 136970865 is about 11703.4552590250. The cubic root of 136970865 is about 515.4771271833.
The spelling of 136970865 in words is "one hundred thirty-six million, nine hundred seventy thousand, eight hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •