Base | Representation |
---|---|
bin | 11000011100001010… |
… | …11111000110101000 |
3 | 1020212102220002110100 |
4 | 30032011133012220 |
5 | 203333013033112 |
6 | 10010001145400 |
7 | 643104352503 |
oct | 141605370650 |
9 | 36772802410 |
10 | 13121221032 |
11 | 5623650627 |
12 | 266232b260 |
13 | 131153561a |
14 | 8c68c213a |
15 | 51bde92dc |
hex | 30e15f1a8 |
13121221032 has 48 divisors (see below), whose sum is σ = 35796058740. Its totient is φ = 4341811968.
The previous prime is 13121221019. The next prime is 13121221037. The reversal of 13121221032 is 23012212131.
It can be written as a sum of positive squares in 2 ways, for example, as 12915413316 + 205807716 = 113646^2 + 14346^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 13121220996 and 13121221014.
It is not an unprimeable number, because it can be changed into a prime (13121221037) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 655243 + ... + 674970.
Almost surely, 213121221032 is an apocalyptic number.
13121221032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13121221032 is an abundant number, since it is smaller than the sum of its proper divisors (22674837708).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13121221032 is a wasteful number, since it uses less digits than its factorization.
13121221032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1330362 (or 1330355 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 13121221032 its reverse (23012212131), we get a palindrome (36133433163).
The spelling of 13121221032 in words is "thirteen billion, one hundred twenty-one million, two hundred twenty-one thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •